| 90 | Subsets II | Medium |
| 91 | Decode Ways | Medium |
| 92 | Reverse Linked List II | Medium |
| 93 | Restore IP Addresses | Medium |
| 94 | Binary Tree Inorder Traversal | Medium |
| 95 | Unique Binary Search Trees II | Medium |
| 96 | Unique Binary Search Trees | Medium |
| 97 | Interleaving String | Hard |
| 98 | Validate Binary Search Tree | Medium |
| 99 | Recover Binary Search Tree | Hard |
| 100 | Same Tree | Easy |
| 101 | Symmetric Tree | Easy |
| 102 | Binary Tree Level Order Traversal | Medium |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium |
| 104 | Maximum Depth of Binary Tree | Easy |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium |
| 107 | Binary Tree Level Order Traversal II | Easy |
| 108 | Convert Sorted Array to Binary Search Tree | Easy |
| 109 | Convert Sorted List to Binary Search Tree | Medium |
| 110 | Balanced Binary Tree | Easy |
| 111 | Minimum Depth of Binary Tree | Easy |
| 112 | Path Sum | Easy |
| 113 | Path Sum II | Medium |
| 114 | Flatten Binary Tree to Linked List | Medium |
| 115 | Distinct Subsequences | Hard |
| 116 | Populating Next Right Pointers in Each Node | Medium |
| 117 | Populating Next Right Pointers in Each Node II | Medium |
| 118 | Pascal's Triangle | Easy |
| 119 | Pascal's Triangle II | Easy |