Binary Search Trees: Complete Interview Playbook

1. What is a BST? A Binary Search Tree is a binary tree where every node obeys a single invariant: For any node N, all values in its left subtree are strictly less than N, and all values in its right