- Check whether a binary tree is a BST or notMedium✓ Solved2 approaches
- BST basics — search, insert, min/maxEasy✓ Solved1 approach
- Delete a node from a BSTMedium✓ Solved1 approach
- Inorder successor and predecessor in a BSTMedium✓ Solved1 approach
- Construct a BST from preorder / validate a preorder sequenceMedium✓ Solved1 approach
- Convert a binary tree to a BST / balance a BST / flatten a BST to a sorted listMedium✓ Solved1 approach
- Merge two BSTsMedium✓ Solved1 approach
- Kth smallest / Kth largest element in a BSTMedium✓ Solved1 approach
- Count pairs from two BSTs whose sum equals XMedium✓ Solved1 approach
- Median of a BST in O(n) time, O(1) space / count nodes in a rangeMedium✓ Solved1 approach
- Replace each element with the least greater element on its rightMedium✓ Solved1 approach
- Find conflicting appointmentsMedium✓ Solved1 approach
- Check whether a BST contains a dead endMedium✓ Solved1 approach
- Largest BST subtree in a binary treeHard✓ Solved1 approach
- Lowest Common Ancestor of a BSTMedium✓ Solved1 approach
- Convert Sorted Array to BSTEasy✓ Solved1 approach