- Each left subtree must be less than node itself.
- Each right subtree must be greater than node.
Problems
- Inorder traversal of a BST Levelorder traversal of a BST Insert a node in a BST Search a node in BST Minimum element in BST Find Common Nodes in two BSTs Delete a node from BST Lowest Common Ancestor in a BST Print BST elements in given range Pair Sum in BST Smaller on Right Floor in BST Ceil in BST Vertical Traversal of Binary tree Top View of Binary Tree Bottom View of Binary Tree Check for BST Find closest Element in BST Convert Level Order Traversal to BST Count BST nodes that lie in a given range Preorder to Binary Tree Merge two BST Fixing Two nodes of a BST