Skip to main content

Structure of a binary search tree

A binary search tree is a special type of binary tree that follows the binary search property.

For every node N in the binary search tree:

  • All the values stored in the left subtree of N are less than the value stored in N
  • All the values stored in the right subtree of N are greater than the value stored in N

Binary Search Property

Liking the course? Check our discounted plans to continue learning.

Subscribe