数据结构中二叉树中序遍历的教学分析

The Teaching Analysis of Inorder Traversing Binary Tree in the Data Structure

数据结构的教学应注重方法的应用,在二叉树的中序遍历中使用投影法可以使遍历过程简单化,再由其中的一种遍历递归算法(先序)推导得到另外两种(中序,后序)的遍历递归算法,让学生加深对整个遍历过程的了解与掌握。

The teaching of tile Data Structure should make a point of the application of the method, using the cast shadow method can make the process of traverse turned in brief at inorder traversing Binary tree. Again from among them of the inside a traverse algorithm（preorder） deduces a trsverse algorithm that get another two kinds of, let student deepen the understanding of whole the process of traverse.