Binary Search Trees

What is a Binary Search Tree?

A binary search tree, or BST is a data structure that stores data in nodes. Node has at most two children. The main benefit is that it is very efficient for searching, inserting, and deleting. BSTs must implement the BST property. Every node in the left subtree must have a value smaller than the node and every node in the right subtree must have a value larger.

Key Features

• Efficient inserting, searching, and deleting in the best case scenario
• Easy to understand
• Can be traversed in order, pre order, post order, or level order

Example Diagram

Learn More

Click here for more information about Binary Search Trees.