| 二叉树后序遍历非递归算法的改进研究 |
| |
| 引用本文： | 章晓勤.二叉树后序遍历非递归算法的改进研究[J].佳木斯工学院学报,2013(6):926-928. |
| |
| 作者姓名： | 章晓勤 |
| |
| 作者单位： | 安徽电子信息职业技术学院,安徽蚌埠233030 |
| |
| 摘 要： | 通过分析二叉树后序遍历过程的特点，结合二叉树先序遍历非递归算法的思想，对传统的二叉树后序遍历非递归算法进行了改进，提出了基于“先序遍历”思想的二叉树后序遍历非递归算法，并在课堂教学中进行了应用，取得了良好的教学效果．
|
| 关 键 词： | 二叉树 先序遍历 后序遍历 非递归算法 |
Study on Improvement of the Non- Recursive Algorithm of Binary Tree Post Order Traverse |
| |
| Affiliation: | ZHANG Xiao - qin (Anhui Vocational College of Electronics ＆ Information Technology, Bengbu 233030, China ) |
| |
| Abstract: | 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. |
| |
| Keywords: | binary tree preorder traverse post order traverse non -recursive algorithm |
| 本文献已被 维普 等数据库收录！ |
