bstnode.h

简单的二叉树实现

#include <iostream.h>
class bstnode
{
	friend class bsTree;
private:
	int key;
	bstnode *leftChild,*rightChild;
public:
	bstnode(bstnode *l,int k,bstnode *r);
};
bstnode::bstnode(bstnode *l,int k,bstnode *r)
{
	key=k;
	leftChild=l;
	rightChild=r;
}