根据前序和中序遍历结果构造二叉树

//binarytree.h #ifndef BINARYTREE_H #define BINARYTREE_H typedef struct node *link; struct node { unsigned char item; link l, r; }; link tree_init(unsigned char VLR[], unsigned char LVR[], int n);

>>阅读原文<<