Geeks for Geeks: Binary Search Tree

Binary Search Tree is a node-based binary tree data structure which has the following properties: (1) the left subtree of a node contains only nodes with keys lesser than the node’s key; (2) the right subtree of a node contains only nodes with keys greater than the node’s key; and (3) the left and right subtree each must also be a binary search tree.