?? btnode2.h
字號:
#ifndef BinaryTreeNode_
#define BinaryTreeNode_
template <class T> class BinaryTree;
template<class E, class K> class BSTree;
template<class E, class K> class DBSTree;
template <class T>
class BinaryTreeNode {
friend BinaryTree<T>;
friend void PlaceBoosters(BinaryTreeNode<T> *);
friend BSTree<T,int>;
friend DBSTree<T,int>;
public:
BinaryTreeNode() {LeftChild = RightChild = 0;}
BinaryTreeNode(const T& e)
{data = e; LeftChild = RightChild = 0;}
BinaryTreeNode(const T& e, BinaryTreeNode *l,
BinaryTreeNode *r)
{data = e; LeftChild = l; RightChild = r;}
private:
T data;
BinaryTreeNode<T> *LeftChild, // left subtree
*RightChild; // right subtree
};
#endif
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -