| 91 |
Height of Special Binary Tree |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 92 |
House Robber III |
Medium |
Dynamic ProgrammingTreeDepth-First Search |
| 93 |
Increasing Order Search Tree |
Easy |
StackTreeDepth-First Search |
| 94 |
Inorder Successor in BST |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 95 |
Inorder Successor in BST II |
Medium |
TreeBinary Search TreeBinary Tree |
| 96 |
Insert into a Binary Search Tree |
Medium |
TreeBinary Search TreeBinary Tree |
| 97 |
Insufficient Nodes in Root to Leaf Paths |
Medium |
TreeDepth-First SearchBinary Tree |
| 98 |
Invert Binary Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 99 |
Is Array a Preorder of Some Binary Tree |
Medium |
StackTreeDepth-First Search |
| 100 |
K-th Largest Perfect Subtree Size in Binary Tree |
Medium |
TreeDepth-First SearchSorting |
| 101 |
Kth Largest Element in a Stream |
Easy |
TreeDesignBinary Search Tree |
| 102 |
Kth Largest Sum in a Binary Tree |
Medium |
TreeBreadth-First SearchSorting |
| 103 |
Kth Smallest Element in a BST |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 104 |
Largest BST Subtree |
Medium |
Dynamic ProgrammingTreeDepth-First Search |
| 105 |
Leaf-Similar Trees |
Easy |
TreeDepth-First SearchBinary Tree |