| 后序遍历二叉树的递归和非递归算法 |
| |
| 引用本文： | 陈朋. 后序遍历二叉树的递归和非递归算法[J]. 安庆师范学院学报(自然科学版), 2005, 11(2): 106-107,128 |
| |
| 作者姓名： | 陈朋 |
| |
| 作者单位： | 安庆师范学院,计算机系,安徽,安庆,246011 |
| |
| 摘 要： | 本文论述了后序遍历二叉树的递归算法和非递归算法。对递归算法中的工作栈的执行过程做了分析;对非递归算法中的重点和难点做了深刻探讨,并给出了相应算法。
|
| 关 键 词： | 二叉树 遍历 递归 栈 |
| 文章编号： | 1007-4260(2005)02-0106-02 |
The Recursive And Non-recursive Algorithm of Post-traversing Binary Tree |
| |
| CHEN Peng. The Recursive And Non-recursive Algorithm of Post-traversing Binary Tree[J]. Journal of Anqing Teachers College(Natural Science Edition), 2005, 11(2): 106-107,128 |
| |
| Authors: | CHEN Peng |
| |
| Abstract: | The article presents the recursive and non-recursive algorithms of postorder-traversing binary tree.It analyses the running course of working stack in recursive algorithm.The important points and difficult points are discussed deeply in non-recursive algorithm.And the corresponding algorithm is shown in detail. |
| |
| Keywords: | binary tree traversing recursive stack |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
