| 100 | Same Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 65% | |
| 101 | Symmetric Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 59% | |
| 102 | Binary Tree Level Order Traversal | — | Medium | TreeBreadth-First SearchBinary Tree | 70% | |
| 103 | Binary Tree Zigzag Level Order Traversal | — | Medium | TreeBreadth-First SearchBinary Tree | 61% | |
| 104 | Maximum Depth of Binary Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 77% | |
| 107 | Binary Tree Level Order Traversal II | — | Medium | TreeBreadth-First SearchBinary Tree | 66% | |
| 111 | Minimum Depth of Binary Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 50% | |
| 112 | Path Sum | — | Easy | TreeDepth-First SearchBreadth-First Search | 53% | |
| 116 | Populating Next Right Pointers in Each Node | — | Medium | Linked ListTreeDepth-First Search | 65% | |
| 117 | Populating Next Right Pointers in Each Node II | — | Medium | Linked ListTreeDepth-First Search | 55% | |
| 126 | Word Ladder II | — | Hard | Hash TableStringBacktracking | 27% | |
| 127 | Word Ladder | — | Hard | Hash TableStringBreadth-First Search | 42% | |
| 130 | Surrounded Regions | — | Medium | ArrayDepth-First SearchBreadth-First Search | 43% | |
| 133 | Clone Graphread | — | Medium | Hash TableDepth-First SearchBreadth-First Search | 62% | |
| 199 | Binary Tree Right Side View | — | Medium | TreeDepth-First SearchBreadth-First Search | 67% | |
| 200 | Number of Islands | — | Medium | ArrayDepth-First SearchBreadth-First Search | 62% | |
| 207 | Course Scheduleread | — | Medium | Depth-First SearchBreadth-First SearchGraph | 49% | |
| 210 | Course Schedule IIread | — | Medium | Depth-First SearchBreadth-First SearchGraph | 53% | |
| 226 | Invert Binary Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 79% | |
| 261 | Graph Valid Tree | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 49% | |
| 269 | Alien Dictionary | — | Hard | ArrayStringDepth-First Search | 37% | |
| 279 | Perfect Squares | — | Medium | MathDynamic ProgrammingBreadth-First Search | 56% | |
| 286 | Walls and Gates | — | Medium | ArrayBreadth-First SearchMatrix | 63% | |
| 297 | Serialize and Deserialize Binary Treeread | — | Hard | StringTreeDepth-First Search | 59% | |
| 301 | Remove Invalid Parentheses | — | Hard | StringBacktrackingBreadth-First Search | 49% | |
| 310 | Minimum Height Trees | — | Medium | Depth-First SearchBreadth-First SearchGraph | 42% | |
| 322 | Coin Change | — | Medium | ArrayDynamic ProgrammingBreadth-First Search | 46% | |
| 323 | Number of Connected Components in an Undirected Graphread | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 64% | |
| 329 | Longest Increasing Path in a Matrix | — | Hard | ArrayDynamic ProgrammingDepth-First Search | 55% | |
| 365 | Water and Jug Problem | — | Medium | MathDepth-First SearchBreadth-First Search | 43% | |
| 399 | Evaluate Divisionread | — | Medium | ArrayStringDepth-First Search | 63% | |
| 404 | Sum of Left Leaves | — | Easy | TreeDepth-First SearchBreadth-First Search | 62% | |
| 407 | Trapping Rain Water II | — | Hard | ArrayBreadth-First SearchHeap (Priority Queue) | 59% | |
| 417 | Pacific Atlantic Water Flow | — | Medium | ArrayDepth-First SearchBreadth-First Search | 57% | |
| 429 | N-ary Tree Level Order Traversal | — | Medium | TreeBreadth-First Search | 71% | |
| 433 | Minimum Genetic Mutation | — | Medium | Hash TableStringBreadth-First Search | 55% | |
| 449 | Serialize and Deserialize BSTread | — | Medium | StringTreeDepth-First Search | 59% | |
| 463 | Island Perimeterread | — | Easy | ArrayDepth-First SearchBreadth-First Search | 73% | |
| 488 | Zuma Game | — | Hard | StringDynamic ProgrammingStack | 32% | |
| 513 | Find Bottom Left Tree Value | — | Medium | TreeDepth-First SearchBreadth-First Search | 72% | |
| 514 | Freedom Trail | — | Hard | StringDynamic ProgrammingDepth-First Search | 59% | |
| 515 | Find Largest Value in Each Tree Row | — | Medium | TreeDepth-First SearchBreadth-First Search | 66% | |
| 529 | Minesweeperread | — | Medium | ArrayDepth-First SearchBreadth-First Search | 68% | |
| 530 | Minimum Absolute Difference in BST | — | Easy | TreeDepth-First SearchBreadth-First Search | 59% | |
| 542 | 01 Matrix | — | Medium | ArrayDynamic ProgrammingBreadth-First Search | 51% | |
| 547 | Number of Provinces | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 68% | |
| 559 | Maximum Depth of N-ary Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 73% | |
| 617 | Merge Two Binary Trees | — | Easy | TreeDepth-First SearchBreadth-First Search | 79% | |
| 623 | Add One Row to Tree | — | Medium | TreeDepth-First SearchBreadth-First Search | 64% | |
| 637 | Average of Levels in Binary Treeread | — | Easy | TreeDepth-First SearchBreadth-First Search | 74% | |