binary search tree

In computer science, a binary search tree (BST) is a binary tree data structure which 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.
See more at Wikipedia.org...