浅谈二分树消去递归的方法

On the two sub-trees eliminate the recursive method

在本科学习阶段,一般的《数据结构》教材中在介绍二分树结构三种遍历时,因为递归方法遍历比较直观,也比较容易理解,所以大多只给出了递归的方法。本文结合研究生阶段《计算机算法》课程的学习,谈谈递归遍历应该如何改成非递归的方法,并对这两种算法性能进行比较。

In the undergraduate learning phase,the general 'data structure' teaching materials,introducing two of three sub-tree traversal,because of the recursive method traverse relatively straightforward,relatively easy to understand,so most only gives the recursive method.In this paper,post-graduate stage 'computer algorithms' course of study,to talk about how to change the recursive traversal non-recursive method,and compare the performance of these two algorithms.