摘要
递归算法在数据结构课程中既是重点又是难点,对递归算法理解和把握直接决定了很多算法的理解。该文通过对递归的概念,举例说明利用递归求解问题的步骤以及通过分析二叉树的前序遍历算法来剖析递归的执行过程,最后给出了递归的直观理解。
Recursive algorithm in data structures in the class is a key and difficult to understand and hold a recursive algorithm to many algorithms to understand.this article on the concept of recursive examples illustrate the use of recursive solve problems through the steps and analysis of the fork of the tree in order before the algorithm to analyze the recursive implementation,and finally gave out a recursive intuitive understanding.
出处
《电脑知识与技术(过刊)》
2011年第5X期3382-3383,3385,共3页
Computer Knowledge and Technology
关键词
数据结构
递归
二叉树
递归生成树
datastructure
recursivealgorithm
linearlist
recursive generate tree