二叉树后序遍历非递归算法的改进研究  

Study on Improvement of the Non-Recursive Algorithm of Binary Tree Post Order Traverse

作　　者：章晓勤[1] 

机构地区：[1]安徽电子信息职业技术学院,安徽蚌埠233030

出　　处：《佳木斯大学学报（自然科学版）》2013年第6期926-928,共3页Journal of Jiamusi University：Natural Science Edition

摘　　要：通过分析二叉树后序遍历过程的特点,结合二叉树先序遍历非递归算法的思想,对传统的二叉树后序遍历非递归算法进行了改进,提出了基于"先序遍历"思想的二叉树后序遍历非递归算法,并在课堂教学中进行了应用,取得了良好的教学效果.The traditional binary tree post order traversal non - recursive algorithm was improved by analy- zing the characteristics of the binary tree post order traversal process, combined with binary tree al non - recursive algorithm thought. A binary tree post order traversal non - recursive algorithm was based on the ＂preorder traverse＂ thought. Good teaching results were achieved in the teaching.

关 键 词：二叉树 先序遍历 后序遍历 非递归算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]