Binary Search Tree

  • Last Updated : 20 Jan, 2023

Learn more about Binary Search Tree in DSA Self Paced Course
Practice Problems on Binary Search Tree !
Recent Articles on Binary Search Tree !

What is Binary Search Tree?

Binary Search Tree is a node-based binary tree data structure which has the following properties:

  • The left subtree of a node contains only nodes with keys lesser than the node’s key.
  • The right subtree of a node contains only nodes with keys greater than the node’s key.
  • The left and right subtree each must also be a binary search tree.

Binary Search Tree

Binary Search Tree


Topic:

Introduction:

  1. Introduction to Binary Search Tree – Data Structure and Algorithm Tutorials
  2. Applications of BST
  3. Application, Advantages and Disadvantages of Binary Search Tree

Basic Operations:

  1. Insertion in Binary Search Tree
  2. Searching in Binary Search Tree
  3. Deletion in Binary Search Tree
  4. Binary Search Tree (BST) Traversals – Inorder, Preorder, Post Order
  5. Convert a normal BST to Balanced BST

DSA-Self-Paced

Standard problems on BST

Quick Links :

Recomended:


My Personal Notes arrow_drop_up