利用构造完全二叉树的方法建立二叉树结构。(1)
实现二叉树的先序、中序、后序遍历以及求深度操作；(2)
利用堆栈进行中序遍历并指出栈内最多元素个数。(The structure of binary tree is established by constructing complete binary tree.
To realize the traversal of the binary tree in order, in order and after order and to find the depth operation;The stack is used for intermediate traversal and the number of the most plural elements in the stack is pointed out.)