| 79 | Word Search | — | Medium | ArrayStringBacktracking | 45% | |
| 94 | Binary Tree Inorder Traversal | — | Easy | StackTreeDepth-First Search | 78% | |
| 98 | Validate Binary Search Tree | — | Medium | TreeDepth-First SearchBinary Search Tree | 34% | |
| 99 | Recover Binary Search Tree | — | Medium | TreeDepth-First SearchBinary Search Tree | 56% | |
| 100 | Same Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 65% | |
| 101 | Symmetric Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 59% | |
| 104 | Maximum Depth of Binary Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 77% | |
| 110 | Balanced Binary Tree | — | Easy | TreeDepth-First SearchBinary Tree | 55% | |
| 111 | Minimum Depth of Binary Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 50% | |
| 112 | Path Sum | — | Easy | TreeDepth-First SearchBreadth-First Search | 53% | |
| 113 | Path Sum II | — | Medium | BacktrackingTreeDepth-First Search | 60% | |
| 114 | Flatten Binary Tree to Linked List | — | Medium | Linked ListStackTree | 68% | |
| 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% | |
| 124 | Binary Tree Maximum Path Sum | — | Hard | Dynamic ProgrammingTreeDepth-First Search | 41% | |
| 129 | Sum Root to Leaf Numbers | — | Medium | TreeDepth-First SearchBinary Tree | 68% | |
| 130 | Surrounded Regions | — | Medium | ArrayDepth-First SearchBreadth-First Search | 43% | |
| 133 | Clone Graphread | — | Medium | Hash TableDepth-First SearchBreadth-First Search | 62% | |
| 144 | Binary Tree Preorder Traversal | — | Easy | StackTreeDepth-First Search | 73% | |
| 145 | Binary Tree Postorder Traversal | — | Easy | StackTreeDepth-First Search | 75% | |
| 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% | |
| 211 | Design Add and Search Words Data Structureread | — | Medium | StringDepth-First SearchDesign | 47% | |
| 226 | Invert Binary Tree | — | Easy | TreeDepth-First SearchBreadth-First Search | 79% | |
| 230 | Kth Smallest Element in a BST | — | Medium | TreeDepth-First SearchBinary Search Tree | 75% | |
| 235 | Lowest Common Ancestor of a Binary Search Tree | — | Medium | TreeDepth-First SearchBinary Search Tree | 68% | |
| 236 | Lowest Common Ancestor of a Binary Tree | — | Medium | TreeDepth-First SearchBinary Tree | 66% | |
| 257 | Binary Tree Paths | — | Easy | StringBacktrackingTree | 66% | |
| 261 | Graph Valid Tree | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 49% | |
| 269 | Alien Dictionary | — | Hard | ArrayStringDepth-First Search | 37% | |
| 297 | Serialize and Deserialize Binary Treeread | — | Hard | StringTreeDepth-First Search | 59% | |
| 310 | Minimum Height Trees | — | Medium | Depth-First SearchBreadth-First SearchGraph | 42% | |
| 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% | |
| 332 | Reconstruct Itinerary | — | Hard | Depth-First SearchGraphEulerian Circuit | 44% | |
| 337 | House Robber III | — | Medium | Dynamic ProgrammingTreeDepth-First Search | 55% | |
| 341 | Flatten Nested List Iteratorread | — | Medium | StackTreeDepth-First Search | 65% | |
| 365 | Water and Jug Problem | — | Medium | MathDepth-First SearchBreadth-First Search | 43% | |
| 385 | Mini Parserread | — | Medium | StringStackDepth-First Search | 40% | |
| 386 | Lexicographical Numbersread | — | Medium | Depth-First SearchTrie | 73% | |
| 388 | Longest Absolute File Pathread | — | Medium | StringStackDepth-First Search | 48% | |
| 399 | Evaluate Divisionread | — | Medium | ArrayStringDepth-First Search | 63% | |
| 404 | Sum of Left Leaves | — | Easy | TreeDepth-First SearchBreadth-First Search | 62% | |
| 417 | Pacific Atlantic Water Flow | — | Medium | ArrayDepth-First SearchBreadth-First Search | 57% | |
| 419 | Battleships in a Board | — | Medium | ArrayDepth-First SearchMatrix | 76% | |
| 430 | Flatten a Multilevel Doubly Linked List | — | Medium | Linked ListDepth-First SearchDoubly-Linked List | 61% | |
| 437 | Path Sum III | — | Medium | TreeDepth-First SearchBinary Tree | 46% | |
| 449 | Serialize and Deserialize BSTread | — | Medium | StringTreeDepth-First Search | 59% | |