The knowledge points of trees and binary trees in Chapter 6 can be summarized as follows:
1. The definition and basic terms of the tree;
2. Binary tree-definition, nature, operation;
3. Storage structure-sequential and chain representation;
4. Traverse the binary tree, the clue binary tree;
5. The storage structure of the tree;
6. Conversion of forests and trees;
7. Traversal of trees and forests;
8. Huffman tree-optimal binary tree, Huffman coding.
For the binary sort tree, the learning arrangement will be done later in the chapter of searching.
Binary tree-definition, properties, operations
(1) The definition of binary tree
(2) The nature of the binary tree
(3) Operation of Binary Tree
Teacher Yan Weimin's textbook P121, the operation methods related to the basic operation P in abstract data types. This part of the content can be used as an understanding.
Knowledge points in the next section, explain: storage structure-sequential chain representation .