7-3 Left-View of Binary Tree (25 分)
#include<iostream>
#include<cstdlib>
#include<vector>
#include<queue>
#include<set>
using namespace std;
const int maxn = 20;
int in[maxn],pre[maxn];
int n;
struct node{
int data;
node* lchild;
node* rchild;
int level;
};
node* createTree(int preL,int preR,int inL,int inR)
{
if(preL>preR)
return NULL;
node* root=(node*)malloc(sizeof(struct node));
root->data = pre[preL];
int i;
for(i=inL; i<=inR; i++)
{
if(in[i]==pre[preL])
break;
}
int k=i-inL;
root->lchild=createTree(preL+1,preL+k,inL,i-1);
root->rchild=createTree(preL+k+1,preR,i+1,inR);
return root;
}
vector<int> ans;
void level(node* root) //层序遍历法
{
set<int> s;
queue<node*> q; //设置一个节点类型的队列
root->level = 1; //标记初始的层为1
q.push(root);
node* tmp;
while(!q.empty())
{
tmp = q.front();
q.pop();
if(s.count(tmp->level)==0)
{
s.insert(tmp->level);
ans.push_back(tmp->data);
}
if(tmp->lchild)
{
tmp->lchild->level = tmp->level+1;
q.push(tmp->lchild);
}
if(tmp->rchild)
{
tmp->rchild->level = tmp->level+1;
q.push(tmp->rchild);
}
}
}
int main()
{
scanf("%d",&n); //读入n
for(int i=0; i<n; i++)
{
scanf("%d",&in[i]); //读入中序遍历的结果
}
for(int i=0; i<n; i++)
{
scanf("%d",&pre[i]); //读入前序遍历的结果
}
node* root = createTree(0,n-1,0,n-1); //建树
level(root);
for(int i=0; i<ans.size(); i++)
{
if(i!=0)
cout << " ";
cout <<