| 76 |
Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 77 |
Find All The Lonely Nodes |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 78 |
Find Bottom Left Tree Value |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 79 |
Find Distance in a Binary Tree |
Medium |
Hash TableTreeDepth-First Search |
| 80 |
Find Duplicate Subtrees |
Medium |
Hash TableTreeDepth-First Search |
| 81 |
Find Elements in a Contaminated Binary Tree |
Medium |
Hash TableTreeDepth-First Search |
| 82 |
Find Largest Value in Each Tree Row |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 83 |
Find Leaves of Binary Tree |
Medium |
TreeDepth-First SearchBinary Tree |
| 84 |
Find Mode in Binary Search Tree |
Easy |
TreeDepth-First SearchBinary Search Tree |
| 85 |
Find Nearest Right Node in Binary Tree |
Medium |
TreeBreadth-First SearchBinary Tree |
| 86 |
Find the Level of Tree with Minimum Sum |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 87 |
Flatten Binary Tree to Linked List |
Medium |
Linked ListStackTree |
| 88 |
Flip Binary Tree To Match Preorder Traversal |
Medium |
TreeDepth-First SearchBinary Tree |
| 89 |
Flip Equivalent Binary Trees |
Medium |
TreeDepth-First SearchBinary Tree |
| 90 |
Height of Binary Tree After Subtree Removal Queries |
Hard |
ArrayTreeDepth-First Search |