bstnode.h

C++写的二叉树类

// BSTNode.h: interface for the BSTNode class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_BSTNODE_H__E41D9118_7AD2_4B8B_BE4E_4DE3828C8A37__INCLUDED_)
#define AFX_BSTNODE_H__E41D9118_7AD2_4B8B_BE4E_4DE3828C8A37__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#define LH	+1
#define EH	0
#define RH	-1
#define TRUE 1
#define FALSE 0
typedef int BOOL;

typedef class BSTNode
{
public:
	BSTNode();
	virtual ~BSTNode();
	void static R_Rotate(BSTNode **p);
	void static L_Rotate(BSTNode **p);
	void static LeftBalance(BSTNode **T);
	void static RightBalance(BSTNode **T);
	int static InsertAVL(BSTNode **T,int key,int &taller);
	void static ASL(BSTNode *T,int level,int &TotalLen,int &n);
	int static InOrderTraverse(BSTNode* T);
protected:
	int bf;
	int data;
	BSTNode *lchild,*rchild;
}* BSTree;

#endif // !defined(AFX_BSTNODE_H__E41D9118_7AD2_4B8B_BE4E_4DE3828C8A37__INCLUDED_)