摘要
本文对二叉树的遍历过程进行了深入的分析,并给出了中序遍历二叉树的递归算法和非递归算法。对递归算法中的工作栈的执行过程做了分析;对非递归算法中的重点和难点做了深刻探讨。
The text deeply analysis the process of binary tree, giving the recursive and non-recursive algorithms of inorder-traversing binary tree. It analyses the running eourse of working staek in recursive algorithm.The important points and difficult points are discussed deeply in nonrecursive algorithm.
出处
《科技信息》
2008年第12期227-227,281,共2页
Science & Technology Information
关键词
二叉树
遍历
递归
栈
算法
binary tree
traversing
recursive
stack
algorithm
