BST problems

35 BST DSA practice problems on CampusCode, each with statement, examples and constraints.

• 875. Search in Binary Search Tree Easy Trees
• 876. Insert into Binary Search Tree Easy Trees
• 877. Delete Node in Binary Search Tree Easy Trees
• 878. Find Minimum in BST Easy Trees
• 879. Find Maximum in BST Easy Trees
• 880. Check if a Tree is a Valid BST Easy Trees
• 881. Inorder Successor in BST Easy Trees
• 882. Inorder Predecessor in BST Easy Trees
• 883. Floor Value in BST Easy Trees
• 884. Ceil Value in BST Easy Trees
• 885. Kth Smallest Element in BST Easy Trees
• 886. Kth Largest Element in BST Easy Trees
• 887. Sorted Array to Balanced BST Easy Trees
• 888. Count Nodes in BST with Keys in Given Range Easy Trees
• 889. Lowest Common Ancestor in BST Easy Trees
• 890. Check if Array is Preorder of BST Easy Trees
• 891. Two Sum in BST Easy Trees
• 892. Find Pairs with Given Sum in BST Easy Trees
• 893. Check if BST Contains Dead End Easy Trees
• 894. Print BST Keys in Given Range Easy Trees
• 918. Delete Node and Return Forest Medium Trees
• 919. Recover BST — Two Swapped Nodes Medium Trees
• 920. Convert Sorted List to BST Medium Trees
• 921. Convert BST to Greater Tree Medium Trees
• 922. Balance a Binary Search Tree Medium Trees
• 923. Merge Two BSTs Medium Trees
• 924. Largest BST Subtree Medium Trees
• 925. Closest Binary Search Tree Value Medium Trees
• 926. Closest BST Values II — K Closest Medium Trees
• 927. BST Iterator (In-Order Lazy Evaluation) Medium Trees
• 937. Recover BST — O(1) Space Morris Hard Trees
• 938. Count of Smaller Numbers After Self (BST/BIT) Hard Trees
• 942. Maximum Sum BST in Binary Tree Hard Trees
• 944. Number of Ways to Reorder Array as BST Hard Trees
• 947. Convert BST to Sorted Doubly Linked List Hard Trees