In computer science, a binary search tree (BST), which may sometimes also be called an ordered or sorted binary tree, is a node-based binary tree data structure which has the following properties:
- The left subtree of a node contains only nodes with keys less than the node's key.
- The right subtree of a node contains only nodes with keys greater than the node's key.
- Both the left and right subtrees must also be binary search trees.
- There must be no duplicate nodes.
Generally, the information represented by each node is a record rather than a single data element. However, for sequencing purposes, nodes are compared according to their keys rather than any part of their associated records.
The major advantage of binary search trees over other data structures is that the related sorting algorithms and search algorithms such as in-order traversal can be very efficient.
Binary search trees are a fundamental data structure used to construct more abstract data structures such as sets, multisets, and associative arrays.
Read more about Binary Search Tree: Operations, Types
Famous quotes containing the words search and/or tree:
“At the ground of all these noble races, the beast of prey, the splendid, blond beast, lustfully roving in search of spoils and victory, cannot be mistaken.”
—Friedrich Nietzsche (1844–1900)
“Like to the tree of Tantalus she fled,
And seeming lavish, sav’de her maydenhead.
Ne’re king more sought to keepe his diademe;
Than Hero this inestimable gemme.”
—Christopher Marlowe (1564–1593)