Data Structures, Tree Data Structures, B Tree, Trees, Algorithms.
2 children. No node has only one child. Complete Binary Tree: All levels of the tree are filled, except possibly for the last level. All nodes are as left as possible. Perfect Binary Tree: All levels of the tree are filled with nodes. The number of nodes on each level is a power of 2. Traversal