Consider a sorted array: [2, 4, 6, 8 ... 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 children.