Binary Search Trees (BSTs): A BST is a tree-like data structure in which each node can have a maximum of two children. Binary search is fundamental to operations such as insertion, deletion, and ...

Each of the algorithms discussed in this section–Linear Search, Binary Search, Bubble Sort, Selection Sort, and Insertion Sort–exhibits a O(1) (constant) space complexity for variable storage.