一.二叉树的存储
结点的定义:
区别:完美二叉树、完全二叉树(顺序存储)。
二.怎样根据后序和中序遍历建立二叉树????????
三.代码
#include <stdio.h>
#include <stdlib.h>
#define MAXN 30
typedef struct LNode *Position;//定义区别链表
typedef Position BinTree;
struct LNode{
int Data;
BinTree Left;
BinTree Right;
};
BinTree BuildTree(int *Inorder,int *Postorder,int N)
{
BinTree T;
if(N<=0) return NULL;
T=(BinTree)malloc(sizeof(struct LNode));
T->Data =Postorder[N-1];//根节点是后序最后一个
T->Left =NULL;
T->Right =NULL;
int i;
for(i=0;i<N;i++){
if(Inorder[i]==Postorder[N-1]) break;
}
T->Left =BuildTree(Inorder,Postorder,i);
T->Right =BuildTree(Inorder+i+1,Postorder+i,N-1-i);//因为Inorder和Postorder是指针,所以可以直接加数字
return T;
}
int flag = 0;
void Preorder(BinTree T)
{
if(T){
if(flag==0){
printf("Preorder: %d",T->Data );
flag=1;
}
else printf(" %d",T->Data );
Preorder(T->Left );
Preorder(T->Right );
}
}
int main()
{
int Inorder[MAXN],Postorder[MAXN],N,i;
scanf("%d",&N);
for(i=0;i<N;i++) scanf("%d",&Postorder[i]);
for(i=0;i<N;i++) scanf("%d",&Inorder[i]);
BinTree T = BuildTree(Inorder,Postorder,N);
Preorder(T);
return 0;
}