HDU 17,102 cross-tree traversal

#include <iostream> #include <stack>using namespace std;typedef struct node{     Node *l,*r;    Both struct node and node  can be  int num;} *tree;tree root;tree creat (int a[],int b[],int n) {tree ss;for (int i=0;i<n;i++) {if (a[0] = = B[i]) {            SS = (tree) Mallo C (sizeof (Node)); ss->num = B[i];ss->l=creat (a+1,b,i); Ss->r=creat (a+i+1,b+i+1,n-i-1); return SS;}} return NULL;} void Post_order (tree h) {     if (H!=null)     //if judgment must not be less, because where the leaves are stopped,     {post_order (h->l);p Ost_order (H- >R); if (root = = h) {Cout<

The root node is obtained from the binate sequence traversal and the middle sequence traversal, and then the left (left subtree) and the right (right subtree) of the root are traversed according to the middle sequence, and then the root is recursively found.
HDU 17,102 cross-tree traversal