二叉树及其遍历算法的应用  

Application of Binary Tree and Its Traversal Algorithm

作　　者：王爱法 杨梅梅 福春霞 WANG Aifa;YANG Meimei;FU Chunxia(College of Science,Chongqing University of Technology, Chongqing 400054, China;Periodical Agency,Chongqing University of Technology, Chongqing 400054, China)

机构地区：[1]重庆理工大学理学院,重庆400054 [2]重庆理工大学期刊社,重庆400054

出　　处：《重庆理工大学学报（自然科学）》2018年第11期194-198,共5页Journal of Chongqing University of Technology：Natural Science

基　　金：重庆市教育委员会科学技术研究项目(KJ1600930);重庆理工大学基金资助项目(2016YB29)

摘　　要：二叉树在网络计算中、生活中有多方面的应用,如将二叉树应用在通风除尘中,既可以减小误差,又可以加大准确度等。而二叉树的遍历算法通常应用在计算中,可以用来打印二叉树,将二叉树直观地表达出来,也可以通过便利算法查找某一元素。主要研究二叉树的各个遍历算法的递归算法和非递归算法,以及二叉树及其遍历的应用。Binary tree is a very important data structure,and many other data structures are based on the basis of the evolution of the two fork tree.For the binary tree traversal,there are three basic rules of the two fork tree:preorder traversal,inorder traversal and postorder traversal.Binary tree has been applied in life and in network computing.The application of the two tree in ventilation and dust removal can reduce the error and increase the accuracy.The ergodic algorithm of binary tree is usually applied in calculation,which can be used to print binary tree,express binary tree intuitively,or find an element by convenient algorithm.In this paper,we mainly study the recursive algorithm and non-recursive algorithm of each traversal algorithm of binary tree,and the application of binary tree and its traversal.

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

分 类 号：O244[理学—计算数学]