C++实现数据结构之遍历树

题目要求:
给出二叉树后序遍历和中序遍历,请给出层序遍历
补充知识(头文件的):
(1) 队列:https://blog.youkuaiyun.com/u010112268/article/details/81162097

(2)algorithm :https://blog.youkuaiyun.com/hy971216/article/details/80056933
容器排序，在STL标砖容器中，只有vector/string/deque可以sort()

(3)vector:https://blog.youkuaiyun.com/duan19920101/article/details/50617190/
vector是一个能够存放任意类型的动态数组
onst用法:
https://blog.youkuaiyun.com/IT_happy_/article/details/84847615
https://www.cnblogs.com/fan-0802-WHU/p/10961279.html

#include <vector> 
#include <iostream> 
using namespace std;
int main()
{
 using namespace std;
 int out[3][2] = { 1, 2, 
    3, 4,
   5, 6 };
 vector <int*> v1;
 v1.push_back(out[0]);
 v1.push_back(out[1]);
 v1.push_back(out[2]);
 cout << v1[0][0] << endl;//1
 cout << v1[0][1] << endl;//2
 cout << v1[1][0] << endl;//3
 cout << v1[1][1] << endl;//4
 cout << v1[2][0] << endl;//5
 cout << v1[2][1] << endl;//6
 return 0;
}

#include<cstdio> 
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn =50;
struct node{
 int data;
 node* lchild;
 node* rchild;
 
};
int pre[maxn],in[maxn],post[maxn];
int n;
node* create(int postl,int postr,int inl,int inr){
 if(postl>postr)
 {
  return NULL;
 }
 node* root=new node;
 root->data =post[postr];
 int k;
 for(k=inl;k<=inr;k++)
 {
  if(in[k]==post[postr])
  {
   break;
  }
 }
 int numleft=k-inl;
 root->lchild =create(postl,postl+numleft-1,inl,k-1);
 root->rchild =create(postl+numleft,postr-1,k+1,inr);
 return root;
} 
int num=0;
void BFS(node* root)
{
 queue<node*> q;
 q.push(root);
 while(!q.empty() )
 {
  node* now=q.front() ;
  q.pop() ;
  printf("%d",now->data );
  num++;
  if(num<n) printf(" ");
  if(now->lchild !=NULL) q.push(now->lchild );
  if(now->rchild !=NULL) q.push(now->rchild );
  } 
}
int main(){
 scanf("d",&n);
 for(int i=0;i<n;i++)
 {
  scanf("d",&post[i]);
 }
 for(int i=0;i<n;i++)
 {
  scanf("d",&in[i]);
 }
 node* root=create(0,n-1,0,n-1);
 BFS(root);
 return 0;
}