8.4 Data Structures & Algorithms: Binary Search Trees (BSTs) for Ordered Collections.

Here we'll use a binary search tree to store ordered data (ordered set or ordered map). Binary Search Trees have both a shape property: A binary tree (but not stricter than that) and an Order Property: Left Child's Value ≤ Parent's Value and Parent's Value ≤ Right Child's Value.