摘要
结合教学中学生难以理解与掌握中序遍历二叉树这一实际情况,本文提出利用下压法进行二叉树的中序遍历,同时,利用栈的思想推导中序遍历二叉树的递归算法和非递归算法,清晰直观,便于学生更好的学习与理解。
A pressing based method of inorder traversing binary tree is presented in this paper to slove the problem that student is difficult to understand and grasp inorder traversing binary tree.Meanwhile,using stack to derive recursive algorithm and non-recursive algorithm of inorder traversing binary tree.The process is clear and intuitional,which is more better for students to learn and understand.
出处
《电脑知识与技术》
2011年第3X期2100-2102,共3页
Computer Knowledge and Technology
关键词
二叉树
中序遍历
教学方法
Binary tree
Inorder traversal
Teaching methods
