A binary search tree (BST), which may sometimes also be named a sorted or ordered binary tree, is an edge based binary tree data structure which has the following functionalities:

• The left subtree of a node acquires only nodes with keys less than the node's key.
• The right subtree of a node acquires only nodes with keys bigger than or equal to the node's key.
• Both the right and left subtrees must also be binary search trees.
• Usually, the information presented by each node is a record rather than a single data component. However, for sequencing purposes, nodes are differentiating according to their keys rather than any phase of their associated records.
• The major benefit of binary search trees over other data structures is that the search algorithms and related sorting algorithms such as in-order traversal can be very useful.