二叉树中序遍历在汉诺塔递归算法教学中的应用  

The Application of the Binary Tree Inorder Traversal in the Tower of Hanoi Recursive Algorithm in Teaching

作　　者：杨建华[1] YANG Jian-hua(Anhui Radio and Television University,Hefei 230022,China)

机构地区：[1]安徽广播电视大学,安徽合肥230022

出　　处：《电脑知识与技术》2020年第31期149-151,共3页Computer Knowledge and Technology

基　　金：安徽高校省级自然科学基金项目(KJ2018A0690)资助;安徽省质量工程项目(2018jyxm0242)资助。

摘　　要：递归算法是计算机专业数据结构与程序设计课程中的重难点,汉诺塔问题是一个使用递归算法实现的经典问题。现有教材往往侧重于汉诺塔问题的分析及程序实现,缺少对递归程序复杂执行过程的解析。教学实践中将汉诺塔问题求解的递归算法与二叉树的中序遍历结合起来,以图解的方式直观展示整个递归函数执行过程,有助于学生真正理解递归思想,也为教师对汉诺塔递归算法的教学提供新思路。Recursive algorithm is an important and difficult point in computer specialty courses of Data Structure and Program Design.The Tower of Hanoi problem is a classical problem which is solved through recursive algorithm.The existing teaching materials tend to focus on analysis and program realization of the Tower of Hanoi problem,lacking in analysis of the complex execution process of the recursive program.We can combine the Tower of Hanoi recursive algorithm of problem solving and binary tree Inorder traversal in educational practice.The entire recursive function execution process is displayed directly in a graphical way,which helps students understand the idea of recursion,and provides a new idea for the teaching of the Tower of Hanoi recursive algorithm.

关 键 词：二叉树 递归 汉诺塔 中序遍历 图解 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]