基础练习 树的创建及遍历（递归、队列的应用）

1. 需要掌握的知识

二叉搜索树、树的遍历、递归和队列的基础知识

2. 代码框架（重点）

2.1 采用的数据结构

结构化数组

typedef int ElementType; //通过typedef增加灵活性，树节点的元素类型若改变，修改typedef语句即可
typedef struct BinarySearchTree *PtrBST;
struct BinarySearchTree
{
	ElementType data;
	PtrBST LeftTree;
	PtrBST RightTree;
};

2.2 各分支函数

1. AddNode()函数，向树中添加结点，属于编码基本功

PtrBST AddNode(PtrBST Tree,ElementType value)
{
	if(!Tree)
	{
		Tree=(PtrBST)malloc(sizeof(struct BinarySearchTree));
		Tree->data=value; 
		Tree->LeftTree=NULL; 
		Tree->RightTree=NULL;
	}
	else
	{
		if(value < Tree->data) 
			Tree->LeftTree=AddNode(Tree->LeftTree,value); 	
		else
			Tree->RightTree=AddNode(Tree->RightTree,value);		
	}
	return Tree;
}

2. CreateBST()函数，调用AddNode()完成建树

PtrBST CreateBST(PtrBST Tree,int NodeNumber)
{
	ElementType value;
	for(int i=0;i<NodeNumber;i++)
	{
		cin>>value;
		Tree=AddNode(Tree,value);
	}
	return Tree;
}

3. PreOrder()函数，通过递归实现树的前序遍历：根 左 右；使用递归时别遗漏函数的返回，如下例中的 树为空时返回空值。

void PreOrder(PtrBST Tree) //root left right
{
	if(!Tree) return;
	cout<<Tree->data<<' ';
	PreOrder(Tree->LeftTree);
	PreOrder(Tree->RightTree);
}

4. inOrder()函数，通过递归实现树的中序遍历：左 根 右

void inOrder(PtrBST Tree) //left root right
{
	if(!Tree) return;
	inOrder(Tree->LeftTree);
	cout<<Tree->data<<' ';
	inOrder(Tree->RightTree);
}

5. PostOrder()函数，通过递归实现树的后序遍历：左 右 根

void PostOrder(PtrBST Tree) //left right root
{
	if(!Tree) return;
	PostOrder(Tree->LeftTree);
	PostOrder(Tree->RightTree);
	cout<<Tree->data<<' '; 
}

6. LevelOrder()函数，通过队列 queue实现树的层序遍历：队列可以存储任何元素，比如 ‘树’

void LevelOrder(PtrBST Tree)
{
	PtrBST first;
	queue<PtrBST> TreeQueue;
	TreeQueue.push(Tree);
	
	while(!TreeQueue.empty())
	{
		first=TreeQueue.front();
		TreeQueue.pop();
		cout<<first->data<<' ';
		if(first->LeftTree) TreeQueue.push(first->LeftTree);
		if(first->RightTree) TreeQueue.push(first->RightTree);
	}
	return;
}

3.完整编码

#include <queue>
#include <cstdlib>
#include <iostream>
using namespace std;

typedef int ElementType;
typedef struct BinarySearchTree *PtrBST;
struct BinarySearchTree
{
	ElementType data;
	PtrBST LeftTree;
	PtrBST RightTree;
};

PtrBST CreateBST(PtrBST Tree,int NodeNumber);
PtrBST AddNode(PtrBST Tree,ElementType value);
void PreOrder(PtrBST Tree);
void inOrder(PtrBST Tree);
void PostOrder(PtrBST Tree);
void LevelOrder(PtrBST Tree);

int main()
{
	int NodeNumber; PtrBST BST=NULL;

	cout<<"Please input BinarySearchTree's Node Number: ";
	cin>>NodeNumber;
	while(NodeNumber)
	{
		cout<<"Please input Node's value: ";
		BST=CreateBST(BST,NodeNumber);
		/*
		cout<<"Here is PreOrder: ";
		PreOrder(BST);
		cout<<endl;
		
		cout<<"Here is inOrder: ";
		inOrder(BST);
		cout<<endl;
		
		cout<<"Here is PostOrder: ";
		PostOrder(BST);
		cout<<endl;
		*/
		cout<<"Here is LevelOrder: ";
		LevelOrder(BST);
		cout<<endl;
		
		cout<<"Please input BinarySearchTree's Node Number: ";
		cin>>NodeNumber;
		BST=NULL;
	}
	
	
	return 0;
} 

void LevelOrder(PtrBST Tree)
{
	PtrBST first;
	queue<PtrBST> TreeQueue;
	TreeQueue.push(Tree);
	
	while(!TreeQueue.empty())
	{
		first=TreeQueue.front();
		TreeQueue.pop();
		cout<<first->data<<' ';
		if(first->LeftTree) TreeQueue.push(first->LeftTree);
		if(first->RightTree) TreeQueue.push(first->RightTree);
	}
	return;
}

void PostOrder(PtrBST Tree) //left right root
{
	if(!Tree) return;
	PostOrder(Tree->LeftTree);
	PostOrder(Tree->RightTree);
	cout<<Tree->data<<' '; 
}

void inOrder(PtrBST Tree) //left root right
{
	if(!Tree) return;
	inOrder(Tree->LeftTree);
	cout<<Tree->data<<' ';
	inOrder(Tree->RightTree);
}

void PreOrder(PtrBST Tree) //root left right
{
	if(!Tree) return;
	cout<<Tree->data<<' ';
	PreOrder(Tree->LeftTree);
	PreOrder(Tree->RightTree);
}

PtrBST AddNode(PtrBST Tree,ElementType value)
{
	if(!Tree)
	{
		Tree=(PtrBST)malloc(sizeof(struct BinarySearchTree));
		Tree->data=value; Tree->LeftTree=NULL; Tree->RightTree=NULL;
	}
	else
	{ 
		if(value < Tree->data) 
			Tree->LeftTree=AddNode(Tree->LeftTree,value); 	
			
		else
			Tree->RightTree=AddNode(Tree->RightTree,value);		
	}
	return Tree;
}
PtrBST CreateBST(PtrBST Tree,int NodeNumber)
{
	ElementType value;
	
	for(int i=0;i<NodeNumber;i++)
	{
		cin>>value;
		Tree=AddNode(Tree,value);
	}
	return Tree;
}

4. 后续计划

递归实际上是堆栈的一种应用：先进后出，尝试使用堆栈完成树的先序、中序、后序遍历

参考信息

浙江大学 陈越、何钦铭老师主讲的数据结构