The sixth chapter of the data structure tree and binary tree are the key chapters in the final exam and postgraduate entrance examination. However, there are many basic concepts of tree and binary tree, and the knowledge points are relatively fragmented. It is necessary for students to make a brain map of the knowledge points, which is convenient for learning and memorizing.
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.
Definition of tree and basic terminology:
(1) A tree is an important non-linear data structure, which is a hierarchical structure defined by branch relationships.
(2) Definition: A tree is a finite set T of n (n>0) nodes, in which: There is one and only one specific node, which is called the root of the tree. When n>1, The remaining nodes can be divided into m (m>0) disjoint finite sets T1, T2,...Tm, each of which is a tree in itself, called a subtree of the root.
(3) Features: Features: ① Hierarchical. ② The root node has no predecessor, the other nodes have a unique predecessor, and there can be multiple successors (or none).
(4) Basic terms:
(5) Check everyone's learning situation and be able to accurately and quickly identify and speak the following basic terms:
