| 121 |
Inorder Successor in BST |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 122 |
Inorder Successor in BST II |
Medium |
TreeBinary Search TreeBinary Tree |
| 123 |
Insert into a Binary Search Tree |
Medium |
TreeBinary Search TreeBinary Tree |
| 124 |
Insufficient Nodes in Root to Leaf Paths |
Medium |
TreeDepth-First SearchBinary Tree |
| 125 |
Invert Binary Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 126 |
Is Array a Preorder of Some Binary Tree |
Medium |
StackTreeDepth-First Search |
| 127 |
K-th Largest Perfect Subtree Size in Binary Tree |
Medium |
TreeDepth-First SearchSorting |
| 128 |
Kill Process |
Medium |
ArrayHash TableTree |
| 129 |
Kth Ancestor of a Tree Node |
Hard |
Binary SearchDynamic ProgrammingBit Manipulation |
| 130 |
Kth Largest Element in a Stream |
Easy |
TreeDesignBinary Search Tree |
| 131 |
Kth Largest Sum in a Binary Tree |
Medium |
TreeBreadth-First SearchSorting |
| 132 |
Kth Smallest Element in a BST |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 133 |
Kth Smallest Path XOR Sum |
Hard |
ArrayTreeDepth-First Search |
| 134 |
Largest BST Subtree |
Medium |
Dynamic ProgrammingTreeDepth-First Search |
| 135 |
Leaf-Similar Trees |
Easy |
TreeDepth-First SearchBinary Tree |