浅谈二叉树的遍历中栈和队列的应用

Application of stack and queue in the traverse of bitree

二叉树是数据结构中的一种重要的数据结构类型,因其非顺序的结构和多种遍历方法,再加上栈和队列的运用,递归和非递归算法的不同的语言描述,使其在遍历算法中显得非常复杂。本文就这一问题进行了简单浅显的探讨。

Bitree is a very important type of Data Structure,because of its im-sequensent strcuture and many ways of traverse,with the use of stack and queue,making the traverse very complex.In the paper,I want to talk something about it.