二叉树的使用

二叉树的二叉链表存储表示

typedef struct TreeNode
{
	char data;
	struct TreeNode *LChild;
	struct TreeNode *RChild;
}BiTree;

示例二叉树

创建二叉树

void CreateBiTree(BiTree **root)
{
	char ch;
	scanf("%c", &ch);
	if (ch == '.'){
		*root = NULL;
	}
	else{
		*root = (BiTree*)malloc(sizeof(struct TreeNode));
		if (*root == NULL)
			exit(-1);
		(*root)->data = ch;
		CreateBiTree(&((*root)->LChild));
		CreateBiTree(&((*root)->RChild));
	}
}

       输入：AB.DF..G..C.E.H..

先序遍历二叉树--递归

void PreOrder(BiTree *root)
{
	if (root != NULL){
		printf(" %c ", root->data);
		PreOrder(root->LChild);
		PreOrder(root->RChild);
	}
}

示例运行结果

先序遍历二叉树--栈实现

void PreOrder_stack(BiTree *root)
{
	stack<BiTree*> B_stack;
	BiTree *p = root;
	while (p != NULL || !B_stack.empty()){
		if (p != NULL){
			printf(" %c ", p->data);
			B_stack.push(p);
			p = p->LChild;
		}
		else{
			p = B_stack.top();
			B_stack.pop();
			p = p->RChild;
		}
	}
}

示例运行结果

中序遍历二叉树--递归

void InOrder(BiTree *root)
{
	if (root != NULL){
		InOrder(root->LChild);
		printf(" %c ", root->data);
		InOrder(root->RChild);
	}
}

示例运行结果

中序遍历二叉树--栈实现

void InOrder_stack(BiTree *root)
{
	stack<BiTree*> B_stack;
	BiTree *p = root;
	while (p != NULL || !B_stack.empty()){
		if (p != NULL){		
			B_stack.push(p);
			p = p->LChild;
		}
		else{
			p = B_stack.top();
			B_stack.pop();
			printf(" %c ", p->data);
			p = p->RChild;
		}
	}
}

示例运行结果

后序遍历二叉树--递归

void PostOrder(BiTree *root)
{
	if (root != NULL){
		PostOrder(root->LChild);
		PostOrder(root->RChild);
		printf(" %c ", root->data);
	}
}

示例运行结果

后序遍历二叉树--栈实现

void PostOrder_stack(BiTree *root)
{
	stack<BiTree*> B_stack;
	BiTree *p = root;
	BiTree *q = NULL;
	while (p != NULL || !B_stack.empty()){
		while (p != NULL){
			B_stack.push(p);
			p = p->LChild;
		}
		if (!B_stack.empty()){
			p = B_stack.top();
			if (p->RChild == NULL || p->RChild == q){
				printf(" %c ", p->data);
				B_stack.pop();
				q = p;
				p = NULL;
			}
			else{
				p = p->RChild;
			}
		}
	}
}

示例运行结果

后序遍历求二叉树高度

int PostDepth(BiTree *root)
{
	int hl, hr, max;
	if (NULL == root){
		return 0;
	}
	else{
		hl = PostDepth(root->LChild);
		hr = PostDepth(root->RChild);
		max = hl > hr ? hl : hr;
		return max + 1;
	}
}

示例运行结果