Binary Search Tree Interview Questions

Ordered trees and BST invariants.

28 problems

#	Title	Difficulty	Topics
220	Contains Duplicate III	Medium	binary search tree
230	Kth Smallest Element in a BST	Medium	binary search tree
235	Lowest Common Ancestor of a Binary Search Tree	Easy	binary search tree
270	Closest Binary Search Tree Value	Easy	binary search tree
285	Inorder Successor in BST	Medium	binary search tree
352	Data Stream as Disjoint Intervals	Hard	binary search tree
449	Serialize and Deserialize BST	Medium	binary search tree
450	Delete Node in a BST	Medium	binary search tree
510	Inorder Successor in BST II	Medium	binary search tree
530	Minimum Absolute Difference in BST	Easy	binary search tree
776	Split BST	Medium	binary search tree
783	Minimum Distance Between BST Nodes	Easy	binary search tree
1373	Maximum Sum BST in Binary Tree	Hard	binary search tree
1382	Balance a Binary Search Tree	Medium	binary search tree
1902	Depth of BST Given Insertion Order	Medium	binary search tree
1932	Merge BSTs to Create Single BST	Hard	binary search tree
2426	Number of Pairs Satisfying Inequality	Hard	binary search tree
2689	Extract Kth Character From The Rope Tree	Medium	binary search tree
2817	Minimum Absolute Difference Between Elements With Constraint	Medium	binary search tree
2907	Maximum Profitable Triplets With Increasing Prices I	Medium	binary search tree
2921	Maximum Profitable Triplets With Increasing Prices II	Hard	binary search tree
2926	Maximum Balanced Subsequence Sum	Hard	binary search tree
3072	Distribute Elements Into Two Arrays II	Hard	binary search tree
3073	Maximum Increasing Triplet Value	Medium	binary search tree
3161	Block Placement Queries	Hard	binary search tree
3165	Maximum Sum of Subsequence With Non-adjacent Elements	Hard	binary search tree
3526	Range XOR Queries with Subarray Reversals	Hard	binary search tree
3930	Power Update After K-th Largest Insertion II	Hard	binary search tree