求二叉树树高，和把由前序和中序构建树，又后序遍历这两步放在同一个递归中完成的两个程序。-Binary tree for tree height, and put by the former sequence and in order to build a tree traversal sequence after another on these two steps completed by the middle of the same