二叉树的创建、（中先后序，广义表）遍历
#include <stdio.h>#include <stdlib.h>#include <time.h>typedef struct Node { int data; struct Node *lchild, *rchild;} Node;typedef struct Tree { Node *root; int n;} Tree;Node *getNe
