| 二叉树遍历的非递归算法分析与实现 |
| |
| 引用本文： | 罗帅.二叉树遍历的非递归算法分析与实现[J].数字社区&智能家居,2008(2):678-680. |
| |
| 作者姓名： | 罗帅 |
| |
| 作者单位： | 湖南农业大学信息科学技术学院,湖南长沙410128 |
| |
| 摘 要： | 对二叉树的遍历过程进行了深入的分析，根据二叉树三种遍历的内在关系给出了求先序序列、中序序列和后序序列的非递归算法，该算法只需对二叉树遍历一次即可求出三种遍历序列。
|
| 关 键 词： | 非递归算法 二叉树 栈 遍历 |
The Analysis and Realization of Traversing Binary Tree With Non-recursive Algorithm |
| |
| LUO Shuai.The Analysis and Realization of Traversing Binary Tree With Non-recursive Algorithm[J].Digital Community & Smart Home,2008(2):678-680. |
| |
| Authors: | LUO Shuai |
| |
| Affiliation: | LUO Shuai(Information Science and Technology College of Hunan Agricultural University, Changsha 410128, China) |
| |
| Abstract: | The article analyses the traversing binary tree. It defines a non-algorithm for preorder-traversing,inorder-traversing and pos- torder-traversing binary tree according to the inline relation among three methods of traversing binary tree. With the algorithm we can obtain three sequences but need only one time to traverse the binary tree. |
| |
| Keywords: | non-recursive algorithm binary tree stack traverse |
| 本文献已被 维普 等数据库收录！ |
