bstnode.h

来自「通用二叉搜索树」· C头文件 代码 · 共 24 行

H
24
字号
//******************************  BSTNode.h  ******************************
//               definition of class BSTNode: binary search tree node
//                              二叉搜索树节点
#ifndef BSTNODE_H
#define BSTNODE_H

template<class T> class BST;  // forward declaration

template<class T>
class BSTNode 
{
	friend class BST<T>;	// friend class
public:
	BSTNode(): lc(0), rc(0) {}
	BSTNode( const T& el, BSTNode* l = 0, BSTNode* r = 0 ) {
		data = el; lc = l; rc = r;
	}
	T getData() const { return data; }
private:
	T data;
	BSTNode<T> *lc, *rc;	// lc: refer to leftchild, rc: refer to rightchild	
};

#endif

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?