bintree.h

计算生物二叉树的matlab具体程序

#include <stdlib.h>

typedef int Key;

struct Node {
	Node* parent;
	Node* left;
	Node* right;
	Key k;
};

typedef Node TNode;

class CBinTree
{
private:
	TNode* m_root;
public:
	CBinTree();
	void InitTree(Key* pK, int iLen);
	TNode* tree_search(Key k, TNode* root); //查找以Root为根，值为k的节点
	TNode* tree_min(TNode* root);
	TNode* tree_max(TNode* root);
	TNode* successor(TNode* x);
	TNode* predecessor(TNode* x);
	void Insert(TNode* z);
 	TNode* Delete(TNode* z);
};