bintreenode.h

1) 以二叉链表为存储结构

// BinTreeNode.h: interface for the BinTreeNode class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_BINTREENODE_H__6AB763D6_3909_4604_A9B5_B3D97477F869__INCLUDED_)
#define AFX_BINTREENODE_H__6AB763D6_3909_4604_A9B5_B3D97477F869__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#include<iostream.h>
class BinTreeNode  //树结点类定义
{
public:
	BinTreeNode* rightchild;
	BinTreeNode* leftchild;
	int data;
	BinTreeNode(int d=0,BinTreeNode*l=NULL,BinTreeNode*r=NULL);
	virtual ~BinTreeNode();
};

#endif // !defined(AFX_BINTREENODE_H__6AB763D6_3909_4604_A9B5_B3D97477F869__INCLUDED_)