| 94. Binary Tree Inorder TraversalOpen source | Easy | StackTreeDepth-First Search+1 more |
| 98. Validate Binary Search TreeOpen source | Medium | TreeDepth-First SearchBinary Search Tree+1 more |
| 100. Same TreeOpen source | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 102. Binary Tree Level Order TraversalOpen source | Medium | TreeBreadth-First SearchBinary Tree |
| 104. Maximum Depth of Binary TreeOpen source | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 105. Construct Binary Tree from Preorder and Inorder TraversalOpen source | Medium | ArrayHash TableDivide and Conquer+2 more |
| 110. Balanced Binary TreeOpen source | Easy | TreeDepth-First SearchBinary Tree |
| 124. Binary Tree Maximum Path SumOpen source | Hard | Dynamic ProgrammingTreeDepth-First Search+2 more |
| 144. Binary Tree Preorder TraversalOpen source | Easy | StackTreeDepth-First Search+1 more |
| 145. Binary Tree Postorder TraversalOpen source | Easy | StackTreeDepth-First Search+1 more |
| 199. Binary Tree Right Side ViewOpen source | Medium | TreeDepth-First SearchBreadth-First Search+1 more |
| 226. Invert Binary TreeOpen source | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 230. Kth Smallest Element in a BSTOpen source | Medium | TreeDepth-First SearchBinary Search Tree+1 more |
| 235. Lowest Common Ancestor of a Binary Search TreeOpen source | Medium | TreeDepth-First SearchBinary Search Tree+3 more |
| 297. Serialize and Deserialize Binary TreeOpen source | Hard | StringTreeDepth-First Search+3 more |
| 337. House Robber IIIOpen source | Medium | Dynamic ProgrammingTreeDepth-First Search+2 more |
| 450. Delete Node in a BSTOpen source | Medium | TreeBinary Search TreeBinary Tree |
| 543. Diameter of Binary TreeOpen source | Easy | TreeDepth-First SearchBinary Tree+1 more |
| 572. Subtree of Another TreeOpen source | Easy | TreeDepth-First SearchString Matching+2 more |
| 701. Insert into a Binary Search TreeOpen source | Medium | TreeBinary Search TreeBinary Tree |
| 703. Kth Largest Element in a StreamOpen source | Easy | TreeDesignBinary Search Tree+3 more |
| 1325. Delete Leaves With a Given ValueOpen source | Medium | TreeDepth-First SearchBinary Tree |
| 1448. Count Good Nodes in Binary TreeOpen source | Medium | TreeDepth-First SearchBreadth-First Search+1 more |