以下问题要求统一在一个大程序里解决。

按先序遍历的扩展序列建立二叉树的存储结构

二叉树先序、中序、后序遍历的递归算法

二叉树中序遍历的非递归算法

二叉树层次遍历的非递归算法

求二叉树的深度(后序遍历)

建立树的存储结构

求树的深度-The following questions require a unified solution in a large program. Extension of the first-traversal sequence to establish the storage structure of the binary tree binary tree preorder, inorder, postorder traversal of a binary tree traversal recursive algorithm non-recursive algorithm for binary-level non-recursive algorithm for traversing a binary tree depth (after preorder) established tree storage structure required depth of the tree