What is a Binary Search Tree (BST)?

This lesson will introduce the Binary Search Trees and their properties.

We'll cover the following

Introduction
- Examples
Binary Search Trees vs. Binary Tree
- Explanation

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.

$NodeValues(left subtree)<=CurrentNodeValue<=NodeValues(right subtree)$

Examples

Let’s see a few examples of BSTs

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.

Introduction to Complexity Measures

Introduction to Arrays

Introduction to Linked Lists

Introduction to Stack/Queues

Introduction to Graphs

Introduction to Trees

Trie

Introduction to Heap

Introduction to Hashing

Summary of Data Structures

What is a Binary Search Tree (BST)?

Introduction

Examples