| 94. Binary Tree Inorder Traversal | Go | Medium | O(n) | O(1) | |
| 96. Unique Binary Search Trees | Go | Medium | O(n^2) | O(n) | |
| 98. Validate Binary Search Tree | Go | Medium | O(n) | O(1) | |
| 99. Recover Binary Search Tree | Go | Hard | O(n) | O(1) | |
| 100. Same Tree | Go | Easy | O(n) | O(1) | |
| 101. Symmetric Tree | Go | Easy | O(n) | O(1) | |
| 102. Binary Tree Level Order Traversal | Go | Medium | O(n) | O(1) | |
| 103. Binary Tree Zigzag Level Order Traversal | Go | Medium | O(n) | O(n) | |
| 104. Maximum Depth of Binary Tree | Go | Easy | O(n) | O(1) | |
| 107. Binary Tree Level Order Traversal II | Go | Easy | O(n) | O(1) | |
| 108. Convert Sorted Array to Binary Search Tree | Go | Easy | O(n) | O(1) | |
| 110. Balanced Binary Tree | Go | Easy | O(n) | O(1) | |
| 111. Minimum Depth of Binary Tree | Go | Easy | O(n) | O(1) | |
| 112. Path Sum | Go | Easy | O(n) | O(1) | |
| 113. Path Sum II | Go | Medium | O(n) | O(1) | |
| 114. Flatten Binary Tree to Linked List | Go | Medium | O(n) | O(1) | |
| 124. Binary Tree Maximum Path Sum | Go | Hard | O(n) | O(1) | |
| 129. Sum Root to Leaf Numbers | Go | Medium | O(n) | O(1) | |
| 144. Binary Tree Preorder Traversal | Go | Medium | O(n) | O(1) | |
| 145. Binary Tree Postorder Traversal | Go | Hard | O(n) | O(1) | |
| 173. Binary Search Tree Iterator | Go | Medium | O(n) | O(1) | |
| 199. Binary Tree Right Side View | Go | Medium | O(n) | O(1) | |
| 222. Count Complete Tree Nodes | Go | Medium | O(n) | O(1) | |
| 226. Invert Binary Tree | Go | Easy | O(n) | O(1) | |
| 230. Kth Smallest Element in a BST | Go | Medium | O(n) | O(1) | |
| 235. Lowest Common Ancestor of a Binary Search Tree | Go | Easy | O(n) | O(1) | |
| 236. Lowest Common Ancestor of a Binary Tree | Go | Medium | O(n) | O(1) | |
| 257. Binary Tree Paths | Go | Easy | O(n) | O(1) | |
| 404. Sum of Left Leaves | Go | Easy | O(n) | O(1) | |
| 437. Path Sum III | Go | Easy | O(n) | O(1) | |
| 515. Find Largest Value in Each Tree Row | Go | Medium | O(n) | O(n) | |
| 637. Average of Levels in Binary Tree | Go | Easy | O(n) | O(n) | |
| 993. Cousins in Binary Tree | Go | Easy | O(n) | O(1) | |
| ————————————— | ——————————— | ————————– | ———————– | ———– | ——– |
