按先序遍历的扩展序列建立二叉树的二叉链表存储结构，实现二叉树先序、中序、后序遍历的递归算法，实现二叉树中序遍历的非递归算法，实现二叉树层次遍历的非递归算法，求二叉树的结点个数，求二叉树的深度。(The binary list storage structure of binary tree is established according to the extended sequence of traversal in the first order, the recursive algorithm of traversal in the first order, the middle order and the later order of binary tree is realized, the non recursive algorithm of traversal in the middle order of binary tree is realized, the non recursive algorithm of traversal in the hierarchy of binary tree is realized, the number of nodes of binary tree is calculated, and the depth of binary tree is calculated.)