当前位置: 代码迷 >> 综合 >> 数据结构实验之二叉树四:(先序中序)还原二叉树 oj
  详细解决方案

数据结构实验之二叉树四:(先序中序)还原二叉树 oj

热度:7   发布时间:2024-01-14 23:05:02.0

数据结构实验之二叉树四:(先序中序)还原二叉树

Time Limit: 1000MS Memory Limit: 65536KB
Problem Description

给定一棵二叉树的先序遍历序列和中序遍历序列,要求计算该二叉树的高度。

Input

输入数据有多组,每组数据第一行输入1个正整数N(1 <= N <= 50)为树中结点总数,随后2行先后给出先序和中序遍历序列,均是长度为N的不包含重复英文字母(区分大小写)的字符串。

 

Output

 输出一个整数,即该二叉树的高度。

Example Input
9 
ABDFGHIEC
FDHGIBEAC
Example Output
5
Hint
Author
xam
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct node
{char data;struct bitree *l,*r;
};
char a[100],b[55];//a前序b中序
int l1,h1,l2,h2;
int count;
struct node *creat() //前序建立
{struct node *root;char c;c = a[l1++];if(c == ',')return NULL;else{root = (struct node *)malloc(sizeof(struct node));root->data = c;root->l=creat();root->r=creat();}return root;
}
struct node *creat2(int n,char *a,char *b)//前序中序建立
{struct node *root;int i;if(n == 0)return NULL;root = (struct node *)malloc(sizeof(struct node));root->data=a[0];for(i = 0;i < n;i++){if(b[i] == a[0])break;}root->l=creat2(i,a+1,b);root->r=creat2(n-i-1,a+i+1,b+i+1);return root;
}
struct node *creat3(int n,char *a,char *b)//中序后序建立
{struct node *root;int i;if(n == 0)return NULL;root = (struct node *)malloc(sizeof(struct node));root->data=b[n-1];for(i = 0;i < n;i++){if(a[i] == b[n-1])break;}root->l=creat3(i,a,b);root->r=creat3(n-i-1,a+i+1,b+i);return root;
}
void preorder(struct node *root) //前序遍历
{struct node *p;p = root;if(p!=NULL){printf("%c",p->data);preorder(p->l);preorder(p->r);}
}
void inorder(struct node *root)//中序遍历
{struct node *p;p = root;if(p!=NULL){inorder(p->l);printf("%c",p->data);inorder(p->r);}
}
void postorder(struct node *root)//后序遍历
{struct node *p;p = root;if(p!=NULL){postorder(p->l);postorder(p->r);printf("%c",p->data);}
}
void lorder(struct node *t)//层次遍历
{if(!t)          //考虑空树return ;struct node *q[100000],*p;int f,r;q[1] = t,f=r=1;while(f<=r){p = q[f];f++;printf("%c",p->data);if(p->l!=NULL){r++;q[r]=p->l;}if(p->r!=NULL){r++;q[r]=p->r;}}
}
int treehight(struct node *t) //二叉数高度
{int h,lh,rh;if(t == NULL){h = 0;}else{lh = treehight(t->l);rh = treehight(t->r);if(lh>rh)h = lh+1;elseh = rh+1;}return h;
}
void leaf(struct node *t) //求叶子数
{if(t){if((t->l==NULL)&&(t->r==NULL)){count++;}leaf(t->l);leaf(t->r);}
}
int main()
{int n,t;while(scanf("%d",&n) != EOF){scanf("%s%s",a,b);struct node *root;root = creat2(n,a,b);printf("%d\n",treehight(root));}return 0;
}