摘要
通过对汉诺问题的递归算法及结果的分析,创造性地借助二叉树的数据结构设计出非递归算法。给出了实现该算法的C++语言源程序。该算法并未真正在物理上生成所谓的二叉树,有别于常规对二叉树结构的使用。
Through analyzing the recursive algorithm and result of Hanoi problem, this paper designs the non--recursive algorithm creatively by dint of the data structure of binary -tree,and presents the source program of C＋ ＋ to make the algorithm. This algorithm hasn＇t really created the same binary- tree physically,and it is different from the traditional binary--tree structure in application.
出处
《电脑开发与应用》
2006年第4期54-56,共3页
Computer Development & Applications
关键词
汉诺
非递归
二叉树
中序遍历
算法
实现
Hanoi, non - recursive, binary - tree, inorder traversal, algorithm, implementation
