（1）熟悉树的各种表示方法和各种遍历方式，掌握有关算法的实现，了解树在计算机科学及其它工程技术中的应用。试设计一个程序，在计算机中构造该二叉树，并对它进行遍历。（2）给定一个图，设计一个程序，找出一条从某一顶点A到另一顶点B边数最少的一条路径。-(1) express a variety of familiar tree traversal methods and a variety of ways and master the necessary algorithm to understand the tree in computer science and other engineering applications. Try to design a procedure, the computer constructed the binary tree and traverse it. (2) to set a plan, design a procedure to find a vertex from a vertex A to another B side of a path at least a few.