第5章 树与二叉树
5.3 二叉树的遍历和线索二叉树
综合应用题 第8题
![在这里插入图片描述](https://img-blog.csdnimg.cn/158e4a3c6d6041aa91c2d625de1754a8.png)
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#define MaxSize 100
using namespace std;
typedef int ElemType;
typedef struct BiTNode{
ElemType data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
BiTree PreInCreat(int a[],int b[],int l1,int h1,int l2,int h2)
{
int i=0;
BiTree root=(BiTNode *)malloc(sizeof(BiTNode));
root->data=a[l1];
for(i=l2;b[i]!=root->data;i++);
int llen=i-l2;
int rlen=h2-i;
if(llen)
root->lchild=PreInCreat(a,b,l1+1,l1+llen,l2,l2+llen-1);
else
root->lchild=NULL;
if(rlen)
root->rchild=PreInCreat(a,b,h1-rlen+1,h1,h2-rlen+1,h2);
else
root->rchild=NULL;
return root;
}
int cnt=0;
int PostOrder(BiTree &B)
{
if(B!=NULL)
{
PostOrder(B->lchild);
PostOrder(B->rchild);
if(B->lchild&&B->rchild)
cnt++;
}
return cnt;
}
int main() {
int a[5]={4,2,1,3,5};
int b[5]={1,2,3,4,5};
BiTree B;
cout<<"二叉树:";
B=PreInCreat(a,b,0,4,0,4);
cout<<PostOrder(B);
return 0;
}
![在这里插入图片描述](https://img-blog.csdnimg.cn/9f9f63d69a9e4bd9b67fe82a91848178.png?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBAb25lIGRheV8xOTAzMDQ=,size_18,color_FFFFFF,t_70,g_se,x_16)