叉链表结构的二叉树的类定义 template <class Type> class Binary Tree i public Binary tree():roo(NULL){}创建一棵空二叉树 Binary Tree( Type value ) RefValue(value), root(NULL&) virtual~ Binary Tree(){ destroy(root)}删除一棵二叉树 virtual int IsEmpty(){ return root=NUL;}判树空 virtual Bin TreeNode< type>* Parent( Bin TreeNode<type> *current) return root- NULL root current? NULL Parent(root, current);}求* current结点的父结点指针 virtual Bin TreeNode< Type>* Left Child( Bin TreeNode<type s current)i return current != NULL? Current-left Child NULL;I 求* current结点的左子结点指针 virtual BinTreeNode< Type>* rightChild( bin TreeNode<type> s current) return current !=NULL Current->rightChild NULL;) /)* current结点的右子结点指针 20212222021/2/22 8 二叉链表结构的二叉树的类定义 template <class Type> class BinaryTree { public: BinaryTree( ) : root(NULL) { }//创建一棵空二叉树 BinaryTree( Type value ) : RefValue(value) , root(NULL) { } virtual ~ BinaryTree( ) { destroy ( root ) }//删除一棵二叉树 virtual int IsEmpty( ) { return root == NULL ;}//判树空 virtual BinTreeNode<Type> * Parent( BinTreeNode<Type> *current ) { return root == NULL || root == current ?NULL : Parent( root , current ) ;}//求*current 结点的父结点指针 virtual BinTreeNode<Type> * LeftChild( BinTreeNode<Type> * current ) { return current != NULL ? Current ->leftChild :NULL ; } //求 *current 结点的左子结点指针 virtual BinTreeNode<Type> * RightChild( BinTreeNode<Type> * current ) { return current != NULL ? Current ->rightChild :NULL ; } //求*current 结点的右子结点指针