| 二叉树后序遍历的非递归化算法讨论 |
| |
| 引用本文： | 尹德辉,孟林,李忠. 二叉树后序遍历的非递归化算法讨论[J]. 西南民族学院学报(自然科学版), 2003, 29(5): 537-538 |
| |
| 作者姓名： | 尹德辉 孟林 李忠 |
| |
| 作者单位： | 宜宾学院计算机科学系，宜宾学院计算机科学系，宜宾学院计算机科学系 四川宜宾 644007，四川宜宾 644007，四川宜宾 644007 |
| |
| 摘 要： | 尽管递归算法具有结构简炼、清晰、可读性强等优点,但递归算法在执行过程会耗费太多的时间和空间,为了追求算法的时空效率,必须将递归算法转化为非递化算法,问题才能得到有效解决,讨论了在递归算法执行过程中栈的变化和给出了改进的非递归化算法.
|
| 关 键 词： | 递归 栈 递归算法 非递归化算化 |
| 文章编号： | 1003-2843(2003)05-0537-02 |
| 修稿时间： | 2003-07-06 |
A discussion of postorder-traverse binary tree with no-recursive algorithm |
| |
| YIN De-hui,MENG Lin,LI Zhong. A discussion of postorder-traverse binary tree with no-recursive algorithm[J]. Journal of Southwest Nationalities College(Natural Science Edition), 2003, 29(5): 537-538 |
| |
| Authors: | YIN De-hui MENG Lin LI Zhong |
| |
| Abstract: | A recursive algorithm structure is simple, clear and readable. But a recursive algorithm will cost too much time and space during the process. We should transform the recursive algorithm into a non-recursive algorithm for time and space efficiency. For this, the alter of stack executing recursive algorithm is discussed, and the improvement of non-recursive algorithm is also given. |
| |
| Keywords: | recursion stack recursive algorithm non-recursive algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
