Explore relationships

Binary Search Tree

In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rootedbinary treedata structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree.

Use + to expand a branch. Click a topic name to open its summary.