节点文献
二叉树后序遍历的非递归化算法讨论
A discussion of postorder-traverse binary tree with no-recursive algorithm
【摘要】 尽管递归算法具有结构简炼、清晰、可读性强等优点,但递归算法在执行过程会耗费太多的时间和空间,为了追求算法的时空效率,必须将递归算法转化为非递化算法,问题才能得到有效解决,讨论了在递归算法执行过程中栈的变化和给出了改进的非递归化算法.
【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.
【关键词】 递归;
栈;
递归算法;
非递归化算化;
【Key words】 recursion; stack; recursive algorithm; non-recursive algorithm;
【Key words】 recursion; stack; recursive algorithm; non-recursive algorithm;
- 【文献出处】 西南民族大学学报(自然科学版) ,Journal of Southwest University for Nationalities (Natural Science Edition) , 编辑部邮箱 ,2003年05期
- 【分类号】TP311.12
- 【被引频次】7
- 【下载频次】184