中序遍历二叉树的非递归算法研究  

Research on Non-Recursive Algorithm of Inorder Traversing Binary Tree

作　　者：吴昊 WU Hao(Shiyuan College of Nanning Normal University,Nanning Guangxi 530226,China)

机构地区：[1]南宁师范大学师园学院,广西南宁530226

出　　处：《信息与电脑》2021年第17期85-88,共4页Information & Computer

基　　金：2020年度广西高校中青年教师科研基础能力提升项目“基于.NET的网页更新检测应用研究”(项目编号:2020KY61020)。

摘　　要：对二叉树非递归算法的研究现状进行简单梳理,介绍二叉树的基本概念和创建过程,重点分析中序遍历二叉树的基本思路。通过对二叉树中序遍历具体实例的剖析,总结出二叉树在进行中序遍历时所呈现的特性;通过对这些特性的分析,得到二叉树在进行中序遍历时的非递归算法。该方法对研究二叉树其他遍历方法的非递归算法具有一定的借鉴作用。In this paper, the research of non-recursive Algorithm of binary tree was briefly reviewed, the basic concept of binary tree and its creation process were briefly introduced, and the basic idea of traversing binary tree in middle order was analyzed.Through the study of a concrete example of order traversal in binary tree, some characteristics of binary tree in the process of order traversal were summarized, the non-recursive Algorithm for binary tree traversing was obtained. This method may offer a reference for studying other non-recursive Algorithms of binary tree traversing.

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

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