Consider a sorted array: [2, 4, 6, 8 ... which can reduce its overall efficiency. Binary Search Trees (BSTs): A BST is a tree-like data structure in which each node can have a maximum of two ...

* binary tree has O(log) lookups, inserts, and removals * sorted array has O(log) lookups and O inserts and removals * sorted array probably has lower coefficient for lookups, although we don't ...