Full Binary Tree, ideal binary tree full Binary Tree

Complete Binary Tree ):

Set the depth of a binary tree to H. Except for layer H, the other layers (1 ~ H-1) are all reached the maximum number of points, the H layer of all nodes are continuously concentrated on the leftmost, This Is The Complete Binary Tree.

 

Ideal binary tree (perfect binary tree ):

Except for the last layer without any sub-nodes, all nodes on each layer have two sub-nodes. The tree is called an ideal binary tree. The height is H (starting from 0) and contains 2 ^ (H + 1)-1 nodes.

Binary Tree is an ideal binary tree.

 

Full Binary Tree ):

In China, it actually refers to the ideal Binary Tree mentioned above. The full Binary Tree defined in the United States and internationally is different from the domestic definition. NIST defines it:

A binary tree in which each node has exactly zero or two children. In other words, every node is either a leaf or has two children.

Full Binary Tree, ideal binary tree full Binary Tree