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