06.01 binary tree storage

One ： Overview of knowledge points

Trees （Tree） yes n（n≥0） A finite set of nodes , When n=0 when , It's an empty tree ;n>0 when , Is a non empty tree . Any non empty tree , Satisfy ：
1) There is only one node called root ;
2) Except for the root node, the other nodes can be divided into m（m＞0） A finite set that doesn't intersect each other T1, T2, …, Tm, Each of these sets is itself a tree , And called the root of the subtree （SubTree）.

It adopts two forms of sequential storage and chain storage .










Binary tree （Binary Tree） yes n（n≥0） A collection of nodes , It may be an empty tree （n=0）; Or a non empty tree . For non empty trees T Satisfy ：
1） There is and only one node called root ;
2) Except for the root node , The other nodes are divided into two disjoint subsets T1 and T2, Known as T The left and right subtrees of , And T1 and T2 Itself is a binary tree .