?　　按先序遍历的扩展序列建立二叉树的二叉链表存储结构，实现二叉树先序、中序、后序遍历的递归算法，实现二叉树中序遍历的非递归算法，实现二叉树层次遍历的非递归算法（要求使用顺序队列，调用顺序队列基本操作实现），求二叉树的深度(后序遍历)。(Two binary linked list storage structure - first traversal of the extended sequence according to the establishment of the two fork tree, the realization of the two binary tree traversal recursive algorithm of the first order, in sequence, after the realization of non recursive algorithm for binary tree traversal two, non - recursive algorithm binary tree traversal of the two level (requires the use of sequential queue the basic operation of the order queue, call for Implementation), the two fork tree depth (postordertraversal).)