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

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

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

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

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

-By first traversing the expansion of the storage structure of binary sequences to establish the first order binary tree, in order, after traversing a binary tree the recursive algorithm in order traversal non-recursive algorithm for traversing binary tree-level non-recursive algorithm to solve the two tree of depth (after traversing)