| 94. Binary Tree Inorder Traversal | Easy | StackTreeDepth-First Search+1 more |
| 95. Unique Binary Search Trees II | Medium | Dynamic ProgrammingBacktrackingTree+2 more |
| 96. Unique Binary Search Trees | Medium | MathDynamic ProgrammingTree+2 more |
| 98. Validate Binary Search Tree | Medium | TreeDepth-First SearchBinary Search Tree+1 more |
| 99. Recover Binary Search Tree | Medium | TreeDepth-First SearchBinary Search Tree+1 more |
| 100. Same Tree | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 101. Symmetric Tree | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 102. Binary Tree Level Order Traversal | Medium | TreeBreadth-First SearchBinary Tree |
| 103. Binary Tree Zigzag Level Order Traversal | Medium | TreeBreadth-First SearchBinary Tree |
| 104. Maximum Depth of Binary Tree | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 105. Construct Binary Tree from Preorder and Inorder Traversal | Medium | ArrayHash TableDivide and Conquer+2 more |
| 106. Construct Binary Tree from Inorder and Postorder Traversal | Medium | ArrayHash TableDivide and Conquer+2 more |
| 107. Binary Tree Level Order Traversal II | Medium | TreeBreadth-First SearchBinary Tree |
| 108. Convert Sorted Array to Binary Search Tree | Easy | ArrayDivide and ConquerTree+2 more |
| 109. Convert Sorted List to Binary Search Tree | Medium | Linked ListDivide and ConquerTree+2 more |
| 110. Balanced Binary Tree | Easy | TreeDepth-First SearchBinary Tree |
| 111. Minimum Depth of Binary Tree | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 112. Path Sum | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 113. Path Sum II | Medium | BacktrackingTreeDepth-First Search+1 more |
| 114. Flatten Binary Tree to Linked List | Medium | Linked ListStackTree+2 more |
| 116. Populating Next Right Pointers in Each Node | Medium | Linked ListTreeDepth-First Search+2 more |
| 117. Populating Next Right Pointers in Each Node II | Medium | Linked ListTreeDepth-First Search+2 more |
| 124. Binary Tree Maximum Path Sum | Hard | Dynamic ProgrammingTreeDepth-First Search+1 more |
| 129. Sum Root to Leaf Numbers | Medium | TreeDepth-First SearchBinary Tree |
| 144. Binary Tree Preorder Traversal | Easy | StackTreeDepth-First Search+1 more |
| 145. Binary Tree Postorder Traversal | Easy | StackTreeDepth-First Search+1 more |
| 156. Binary Tree Upside DownPremium | Medium | TreeDepth-First SearchBinary Tree |
| 173. Binary Search Tree Iterator | Medium | StackTreeDesign+3 more |
| 199. Binary Tree Right Side View | Medium | TreeDepth-First SearchBreadth-First Search+1 more |
| 222. Count Complete Tree Nodes | Medium | Binary SearchBit ManipulationTree+1 more |
| 226. Invert Binary Tree | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 230. Kth Smallest Element in a BST | Medium | TreeDepth-First SearchBinary Search Tree+1 more |
| 235. Lowest Common Ancestor of a Binary Search Tree | Medium | TreeDepth-First SearchBinary Search Tree+1 more |
| 236. Lowest Common Ancestor of a Binary Tree | Medium | TreeDepth-First SearchBinary Tree |
| 250. Count Univalue SubtreesPremium | Medium | TreeDepth-First SearchBinary Tree |