摘要
在对二叉树存储结构进行分析的基础上,介绍二叉树遍历算法的一种应用,即基于求解二叉树深度算法设计实现的搜索二叉树中最长路径的算法。这里详细介绍了搜索二叉树中最长路径问题的分析解决思路,在对可能的预期结果进行分析的基础上,给出了算法的设计方案,同时给出了具体的C语言算法描述。
By analyzing the storage structure of binary tree, a kind of application of binary tree traversal algorithm, that is, the algorithm of searching the longest path in binary tree, which is realized by solving the depth of binary tree, is introduced. The solution ideas of searching the longest path in binary tree are proposed in detail. The design scheme of the algorithm is given by analysing the expected results. The algorithm description in C language is presented.
出处
《现代电子技术》
2010年第8期54-55,58,共3页
Modern Electronics Technique
基金
渭南师范学院研究生专项资助项目(10YKS057)
关键词
二叉树
二叉树遍历
完全二叉树
二叉树的最长路径
二叉树深度
binary tree
binary tree traverse
complete binary tree
longest path in binary tree
depth of binary tree
