Data Structure: Binary and other trees (data structure, Algorithm and Application (C ++ language description) Chapter 8th)

8.1 Trees

--> Basic concepts of root, children, parent, siblings, leaf; level and degree of element

8.2 Binary Trees

--> What kind of tree is Binary Tree?

8.3. Properties of Binary Tree

--> Relationship between the number of nodes and height of the tree

--> Full binary tree to complete binary tree

--> Relationship between parent and child sequence numbers in the complete binary tree: it is also the basis for implementing binary tree using the formula-based method.

8.4. Representation of Binary Trees

--> Formula-based representation: array

: Only efficient when the number of missing elements is small.

--> Linked Representation

: PreOrder, InOrder, PostOrder Traversal (recursive) use stack

: LevelOrder Traversal (not recursive) use queue

: Leads to an important logic. If each step of an algorithm can be implemented in a stack mode, the algorithm may be implemented using a recursive method.