Categories
data structures

Data Structures – Binary Search Trees

In this video, we will learn about yet another data structure and that is Binary Search Trees. Binary Search Tree is a binary tree data structure which has the following properties:

  1. The left subtree of a node contains only nodes with data lesser than the node’s data.
  2. The right subtree of a node contains only nodes with data greater than the node’s data.
  3. The left and right subtree each must also be a binary search tree.