| 91 |
Evaluate Boolean Binary Tree |
Easy |
TreeDepth-First SearchBinary Tree |
| 92 |
Even Odd Tree |
Medium |
TreeBreadth-First SearchBinary Tree |
| 93 |
Extract Kth Character From The Rope Tree |
Easy |
TreeDepth-First SearchBinary Tree |
| 94 |
Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 95 |
Find All The Lonely Nodes |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 96 |
Find Bottom Left Tree Value |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 97 |
Find Distance in a Binary Tree |
Medium |
Hash TableTreeDepth-First Search |
| 98 |
Find Duplicate Subtrees |
Medium |
Hash TableTreeDepth-First Search |
| 99 |
Find Elements in a Contaminated Binary Tree |
Medium |
Hash TableTreeDepth-First Search |
| 100 |
Find Largest Value in Each Tree Row |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 101 |
Find Leaves of Binary Tree |
Medium |
TreeDepth-First SearchBinary Tree |
| 102 |
Find Minimum Diameter After Merging Two Trees |
Hard |
TreeDepth-First SearchBreadth-First Search |
| 103 |
Find Mode in Binary Search Tree |
Easy |
TreeDepth-First SearchBinary Search Tree |
| 104 |
Find Nearest Right Node in Binary Tree |
Medium |
TreeBreadth-First SearchBinary Tree |
| 105 |
Find Number of Coins to Place in Tree Nodes |
Hard |
Dynamic ProgrammingTreeDepth-First Search |