1．掌握二叉树的基本概念和性质

2．掌握创建和构造二叉链表的算法

3．掌握二叉树链表存储基础的的三种递归遍历算法和非递归算法。

4．掌握计算二叉树的结点、二叉树的深度和二叉树的叶子结点数等算法。

5．掌握huffman树的构造和编码。

实验要求：（1）理解二叉链表的初始化、二叉树空的判断；（2）理解二叉树的遍历算法，掌握其应用。

-A. Grasp the basic concepts and properties of the binary tree. Master to create and construct a binary linked list algorithm. Master binary tree linked list is stored based on the three recursive traversal algorithm and non-recursive algorithm. 4. To master computing node of the binary tree algorithm of depth of the binary tree and binary tree leaf nodes. 5 Master the structure and encoding of the huffman tree. Experiments: (1) to understand the judgment of the initialization of the binary linked list, binary tree empty　(2) understand the binary tree traversal algorithm, and control over their applications.