Binary Search Tree? (BST)

What is a BST

In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data 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.

Common Operations

• Search : Finding a value in the the BST
• Insert : adding a new value while preserving the BST property
• Delete: removing a value and restructure the tree if needed

Here is a sample BST diagram

More info

For a detailed explanation of BSTs, including implementation and complexity, see: