binarytree.h

1) 以二叉链表为存储结构

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

#if !defined(AFX_BINARYTREE_H__E4A4CAA7_5978_4385_86B6_0635A31BA40F__INCLUDED_)
#define AFX_BINARYTREE_H__E4A4CAA7_5978_4385_86B6_0635A31BA40F__INCLUDED_

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

#include"BinTreeNode.h"
#include"LinkedQueue.h"
class BinaryTree              //树的类定义
{
public:
	BinaryTree();
	
	void create(){root=create1();}
	void preorder(){preorder(root);cout<<endl;}
	void inorder(){inorder(root);cout<<endl;}
	void postorder(){postorder(root);cout<<endl;}
	int size(){return size(root);}
	int leaf(){return leaf(root);}
	int height(){return height(root);}
	void levelOrder();
protected:
	BinTreeNode* create1();
	void preorder(BinTreeNode*r);
	void inorder(BinTreeNode*r);
	void postorder(BinTreeNode*r);
	int size(BinTreeNode*r);
	int leaf(BinTreeNode*r);
	int height(BinTreeNode*r);
private:
	BinTreeNode* root;
};


#endif // !defined(AFX_BINARYTREE_H__E4A4CAA7_5978_4385_86B6_0635A31BA40F__INCLUDED_)