先序 + 中序 恢复二叉树 void createBinaryTree(BintreeNode *& t, char * preorder, char * inorder, int n) { if (n == 0) { t = NULL; } else { int k = 0; while (preorder[0] != inorder[k]) { ++ k; } t = (BintreeNode *)malloc(sizeof(BintreeNode)); assert(t != NULL); t->data = inorder[k]; createBinaryTree(t-&...