Skip to content

Topic 17 of 21

Binary Search Tree Problems

Search, insert and delete in a BST, floor and ceil, Kth smallest element, validation, LCA, inorder successor and recovering a BST.

16 binary search tree problems (5 easy, 8 medium, 3 hard) with LeetCode and GeeksforGeeks links.

Your progress

– / 16 solved

Easy
–/5
Medium
–/8
Hard
–/3
  1. Introduction to Binary Search TreeEasyLeetCode
  2. Search in a Binary Search TreeEasyLeetCodeGFG
  3. Find Min/Max in BSTMediumGFG
  4. Ceil in a Binary Search TreeEasyGFG
  5. Floor in a Binary Search TreeEasyGFG
  6. Insert a Given Node in Binary Search TreeEasyLeetCodeGFG
  7. Delete a Node in Binary Search TreeMediumLeetCodeGFG
  8. Find K-th Smallest/Largest Element in BSTMediumLeetCodeGFG
  9. Check If a Tree Is a BST or BTMediumLeetCodeGFG
  10. LCA in Binary Search TreeMediumLeetCodeGFG
  11. Construct a BST from a Preorder TraversalMediumLeetCodeGFG
  12. Inorder Successor/Predecessor in BSTMediumLeetCodeGFG
  13. Merge 2 BST'sHardGFG
  14. Two Sum in BST | Check If There Exists a Pair with Sum KMediumLeetCodeGFG
  15. Recover BST | Correct BST with Two Nodes SwappedHardLeetCodeGFG
  16. Largest BST in Binary TreeHardGFG