zheng.h

二叉树木后序遍历代码欢迎批评指正,如果有好的代码欢迎发到该网站让大家共享

#include <windows.h>
typedef int ElemType;
struct BTreeNode 
{
	ElemType Data;
	BTreeNode* pLeft;
	BTreeNode* pRight;
};
class BTree
{
public:
	enum TraversType{
		FIRST_TRAVERS_BTREE = 0,
		MIDDLE_TRAVERS_BTREE,
		LAST_TRAVERS_BTRSS
	};
//	void InitBTree();
	BTree();
//	~BTree();
	void CreatBTree(ElemType* &pArr,BTreeNode *&pCur);
	void TraversBTree(TraversType TraversType);	//Travers BTree with any Type;
	ULONG GetBTreeLength(BTreeNode *pBtr);
	ULONG GetBTreeLength();
	BOOL IsBTreeEmpty();
	ULONG GetBTreeCount();
	ULONG GetBTreeCount(BTreeNode *pBtr);
	ULONG GetBTreeLeafCount(BTreeNode *pBtr);
	BTreeNode *pRoot;
	void preOrderTravers();
	void InOrderTravers();
	void PostOrderTravers();
	void Path(ElemType a_Data);
	int GetLayers(BTreeNode *pCur,ElemType a_Data);	


};
class Stack
{
	public:
		Stack();
		BOOL Push(BTreeNode* pBtr);
		BTreeNode* Pop();
		BTreeNode* GetTop();
		BOOL IsStackEmpty();
	private:
		BTreeNode* pStack[100];
		int nTop;
};