Skip to content

Binary Search Tree

Overview

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

  • All nodes' keys of left subtree are less than the node's key;
  • All nodes' keys of right subtree are greater than the node's key;
  • Each of the left and right subtree is a binary search tree.