C++通过后序遍历序列以及前序遍历序列创建二叉树

最新推荐文章于 2023-01-25 14:51:23 发布

马斯塔

最新推荐文章于 2023-01-25 14:51:23 发布

阅读量338

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/qq_43036419/article/details/111032587

版权

#include<iostream>
using namespace std;
typedef char TElemType;

typedef struct node {
	struct node*lchild=NULL, *rchild=NULL;
	TElemType data;
}TNode;

void CreateTreeSub(TNode*&BT, TElemType frontOrder[],int frontStart,int frontEnd ,TElemType InOrder[],int inStart,int inEnd)
{
	if (frontStart <= frontEnd)
	{
		BT = new TNode;
		BT->data = frontOrder[frontStart];
		int i;
		for ( i = inStart;i < inEnd;i++)
			if (InOrder[i] == frontOrder[frontStart])
				break;
		CreateTreeSub(BT->rchild, frontOrder, frontStart + 1 + i - inStart, frontEnd, InOrder, i + 1, inEnd);
		CreateTreeSub(BT->lchild, frontOrder, frontStart + 1, frontStart + i - inStart, InOrder, inStart, i - 1);
	}
}

void CreateTree(TNode*&root,TElemType frontOrder[],int m ,TElemType InOrder[],int n)
{
	int frontStart = 0;
	int frontEnd = m;
	int inStart = 0;
	int inEnd = n;
	CreateTreeSub(root,frontOrder,frontStart,frontEnd-1, InOrder,inStart,inEnd-1);
}

void dispTree(TNode*root)
{
	if (root != NULL)
	{
		cout << root->data;
		dispTree(root->lchild);
		dispTree(root->rchild);
	}
}

int main()
{
	TNode*root=NULL;
	char frontOrder[] = "ABCDEFG";
	char inOrder[] = "CBDAFEG";
	CreateTree(root,frontOrder,sizeof(frontOrder),inOrder,sizeof(inOrder));
	dispTree(root);
	system("pause");

}