本程序是用TC编写，实现按中序遍历一个二叉树，并求出此二叉树的深度和高度。

①　　输入的形式：所输入的元素均为整数

②　　程序所要达到的功能：输入1，2，3输出按中序遍历好的二叉树3，2，1

③　　并求得二叉树的结点数为3，深度为3

-This procedure is used to prepare TC to achieve by the traversal of a binary tree, and derive this binary tree of depth and height. ① input form: the input elements are integers ② procedures to achieve the functions of: Enter the 1,2,3 in the output sequence in accordance with good tree traversal and 3,2,1 ③ obtained binary tree nodes 3, a depth of 3