遍历二叉树时工作栈变化情况的研究

Research on variety of working stack in traversing a binary tree

二叉树是一种常用的数据结构 ,对二叉树的遍历通常采用递归调用的算法 ,但对调用过程中语句调用的顺序和参数传递情况的理解容易被忽略。文中通过举例详细分析工作栈的变化情况 。

Binary tree is a kind of data structure and recursive algorithm is usually used in traversing a binary tree.But it is always neglected to understand the details about the sequence of calling sentences and transferring parameters.The paper,based on detailed analyzing the variety of working stack by an example,explains the whole running procedure of traversing a binary tree.