What is a binary search tree?

What is a binary search tree?

A binary search tree (BST) is a data structure that maintains sorted data for efficient insertion, deletion, and lookup.

How does it differ from a regular binary tree?

In a binary search tree, for each node, the left subtree contains only nodes with values less than the node's value, and the right subtree contains only nodes with values greater.

Can you give me an example of how to insert values into a BST?

Sure! If you start with an empty BST and insert values 5, 3, and 7, the tree will look like this: 5 as the root, 3 as the left child, and 7 as the right child.

What are the time complexities for search, insert, and delete operations?

In a balanced binary search tree, the time complexities are O(log n) for search, insert, and delete operations.