Binary Search Tree

A node-based tree data structure in which each node's left subtree holds only lesser values and its right subtree only greater ones, giving search, insertion and deletion roughly proportional to the tree's height. The structure was discovered independently by several researchers around 1960, including P.F. Windley, Andrew Donald Booth, Andrew Colin and Thomas N. Hibbard; it is formally attributed to Conway Berners-Lee and David Wheeler, who used it for storing labeled data on magnetic tape in 1960, while Hibbard's own variant became especially influential in practice. A genuine case of simultaneous discovery rather than a single inventor, and a different entity from this atlas's existing Binary Search algorithm despite the shared name. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/