已知一棵二叉樹的先序序列和中序序列，創建該二叉樹的二叉鏈表

#include<stdio.h> #include<stdlib.h> typedef int status; typedef struct BiTNode { int data; struct BiTNode* lchild, *rchild; }BiTNode, *BiTree; /* BiTree creat() { BiTree root = (BiTree)malloc(sizeo

>>阅读原文<<