What is a Binary Search Tree (BST)?

An introduction to the “binary search trees” and their properties.

We'll cover the following

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

Introduction

In a binary search tree (BST), the values of nodes in the left-subtree should be equal to or less than the value of the current node. Similarly, the values of all the nodes in the right-subtree should be equal to or greater than the value of the current node.

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

Examples

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