1127. ZigZagging on a Tree (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Suppose that all the keys in a binary tree are distinct positive in

传送门 #include<stdio.h>#include<queue>#include<algorithm> #define MAX_N 32using namespace std;typedef struct Node {Node *lchild;Node *rchild;int data;int level;}node,*BTtree;int in[MAX_N],post[MAX_