Computer Programming Software Terms, Glossary and Dictionary
BST: Binary Search Tree
A binary search tree (BST), also called ordered binary tree, is a type of binary tree where the nodes are arranged in order: for each node, all elements in its left subtree are less-or-equal to the node (<=), and all the elements in its right subtree are greater than the node (>). BST has the following properties:
- Each node has a value.
- A total order is defined on these values.
- The left subtree of a node contains only values less than the node's value.
- The right subtree of a node contains only values greater than or equal to the node's value.
- The major advantage of binary search trees is that the related sorting algorithms and search algorithms such as in-order traversal can be very efficient.