二叉树的抽家数据类烈 template <class Type> class BinaryTree i public BinaryTree( Binary Tree( Bin TreeNode<Type>* lch Bin TreeNode<Type>*rch, Type item int /( Bin TreeNode<Type>xParent (; Bin TreeNode<Type> *leftchild o; Bin TreeNode<Type>* RightChild (; int Insert( const Type &item ) int Find( const Type &item )const Type GetData( consts Bin TreeNode<Type> *Getroot( const二叉树的抽象数据类型 template <class Type> class BinaryTree { public: BinaryTree ( ); BinaryTree ( BinTreeNode<Type> * lch, BinTreeNode<Type> * rch, Type item ); int IsEmpty ( ); BinTreeNode<Type> *Parent ( ); BinTreeNode<Type> *LeftChild ( ); BinTreeNode<Type> *RightChild ( ); int Insert ( const Type &item ); int Find ( const Type &item ) const; Type GetData ( ) const; BinTreeNode<Type> *GetRoot ( ) const; }