| 16 |
Find Mode in Binary Search Tree |
Easy |
TreeDepth-First SearchBinary Search Tree |
| 17 |
Increasing Order Search Tree |
Easy |
StackTreeDepth-First Search |
| 18 |
Inorder Successor in BST |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 19 |
Inorder Successor in BST II |
Medium |
TreeBinary Search TreeBinary Tree |
| 20 |
Insert into a Binary Search Tree |
Medium |
TreeBinary Search TreeBinary Tree |
| 21 |
Kth Largest Element in a Stream |
Easy |
TreeDesignBinary Search Tree |
| 22 |
Kth Smallest Element in a BST |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 23 |
Largest BST Subtree |
Medium |
Dynamic ProgrammingTreeDepth-First Search |
| 24 |
Lowest Common Ancestor of a Binary Search Tree |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 25 |
Maximum Sum BST in Binary Tree |
Hard |
Dynamic ProgrammingTreeDepth-First Search |
| 26 |
Minimum Absolute Difference in BST |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 27 |
Minimum Distance Between BST Nodes |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 28 |
Number of Ways to Reorder Array to Get Same BST |
Hard |
ArrayMathDivide and Conquer |
| 29 |
Range Sum of BST |
Easy |
TreeDepth-First SearchBinary Search Tree |
| 30 |
Recover Binary Search Tree |
Medium |
TreeDepth-First SearchBinary Search Tree |