Table of Contents
A tree in which every parent has at most 2 children is a binary tree.
The most common use of binary trees is for ADTs that require frequent searches for arbitrary keys.
E.g., sets, maps
For this we use a special form of binary tree, the binary search tree.