Data structure (3 trees)

I. Overview: Forest, tree, binary tree, optimal binary tree (Heman tree), full Binary Tree, and full binary tree. These concepts are the same, mainly from general to special, from special to general evolution and collapse.

 

2. concepts to be mastered

1. Binary Tree Storage Structure: Linear storage structure, binary chain table Storage, binary chain table Storage, binary chain table storage, and various storage formatsAlgorithmIncluding traversal, search, insertion, and deletion. traversal is the most basic operation.

 

2. Tree storage structures and algorithms can be obtained from special to general: Binary linked list (child-brother) Storage and parent table Storage.

 

3. Conversion from trees and forests to binary trees.

 

4. The calculation method of Heman encoding.

 

Iii. Implementation of Binary Tree sequential Storage Structure and algorithms: