| Binary Search Tree (2009) | |||||||||
Abstract | |||||||||
| The binary tree structure can be used as an efficient way to organize data objects that are totally ordered. This is done by maintaining the tree in such a way that for any given subtree, the data elements in its left subtree are less than the root and the data elements in the right subtree are greater than the root. Such a binary tree is called a binary search tree. | |||||||||
Publication details | |||||||||
| |||||||||