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

2. 掌握完全二叉树存储结构。

3．掌握完全二叉树的基本操作

4.创建完全二叉树（用字母表示节点）(用顺序方式存储)

5.求二叉树的深度和叶子结点数

6.实现二叉树的前序、中序、后序和层次遍历。

7.查找给定结点的双亲、祖先和左右孩子节点。

-1. Grasp the concept and nature of the binary tree master the complete binary tree storage structure. 3. Grasp the basic operation of the complete binary tree to create a complete binary tree (letters node) stored (order) 5. The depth and leaf nodes of the binary tree binary tree sequence, sequence after sequence and traverse the level. Find the set of nodes for parents, ancestors, and the left and right child nodes.