What is a Binary Search Tree (BST)?
This lesson will introduce the Binary Search Trees and their properties.
We'll cover the following
Introduction
In Binary Search Tree, the values of nodes in the left sub-tree should be equal to or less than the value of the current node. Similarly, the values of all the nodes in the right sub-tree should be equal to or greater than the value of the current node.
Examples
Let’s see a few examples of BSTs
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.