Data Structures

A binary search tree: the root is a node containing '17'. '12' and '35' are the left and right children of '17', respectively. The children of '12' are '6' (left) and '14' (right). The single, right child of '35' is '40'. The single, left child of '40' is '42'.

A binary search tree. Taken from Bell, John T. "Operating-System Structures." University of Illinois, Chicago.

These notes by Miriam Briskman are licensed under CC BY-NC 4.0 and based on sources.