| 0094 | Binary Tree Inorder Traversal | Go | Easy | O(n) | O(1) | | 72.9% |
| 0095 | Unique Binary Search Trees II | Go | Medium | | | | 51.5% |
| 0096 | Unique Binary Search Trees | Go | Medium | O(n^2) | O(n) | | 59.2% |
| 0098 | Validate Binary Search Tree | Go | Medium | O(n) | O(1) | | 31.7% |
| 0099 | Recover Binary Search Tree | Go | Medium | O(n) | O(1) | | 50.2% |
| 0100 | Same Tree | Go | Easy | O(n) | O(1) | | 56.3% |
| 0101 | Symmetric Tree | Go | Easy | O(n) | O(1) | | 52.9% |
| 0102 | Binary Tree Level Order Traversal | Go | Medium | O(n) | O(1) | | 63.2% |
| 0103 | Binary Tree Zigzag Level Order Traversal | Go | Medium | O(n) | O(n) | | 55.1% |
| 0104 | Maximum Depth of Binary Tree | Go | Easy | O(n) | O(1) | | 73.1% |
| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | Go | Medium | | | | 60.7% |
| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | Go | Medium | | | | 57.4% |
| 0107 | Binary Tree Level Order Traversal II | Go | Medium | O(n) | O(1) | | 60.3% |
| 0108 | Convert Sorted Array to Binary Search Tree | Go | Easy | O(n) | O(1) | | 69.0% |
| 0109 | Convert Sorted List to Binary Search Tree | Go | Medium | | | | 57.2% |
| 0110 | Balanced Binary Tree | Go | Easy | O(n) | O(1) | | 48.1% |
| 0111 | Minimum Depth of Binary Tree | Go | Easy | O(n) | O(1) | | 43.5% |
| 0112 | Path Sum | Go | Easy | O(n) | O(1) | | 47.6% |
| 0113 | Path Sum II | Go | Medium | O(n) | O(1) | | 56.6% |
| 0114 | Flatten Binary Tree to Linked List | Go | Medium | O(n) | O(1) | | 61.1% |
| 0116 | Populating Next Right Pointers in Each Node | Go | Medium | | | | 59.3% |
| 0124 | Binary Tree Maximum Path Sum | Go | Hard | O(n) | O(1) | | 38.4% |
| 0129 | Sum Root to Leaf Numbers | Go | Medium | O(n) | O(1) | | 58.6% |
| 0144 | Binary Tree Preorder Traversal | Go | Easy | O(n) | O(1) | | 64.6% |
| 0145 | Binary Tree Postorder Traversal | Go | Easy | O(n) | O(1) | | 66.5% |
| 0173 | Binary Search Tree Iterator | Go | Medium | O(n) | O(1) | | 69.0% |
| 0199 | Binary Tree Right Side View | Go | Medium | O(n) | O(1) | | 61.2% |
| 0222 | Count Complete Tree Nodes | Go | Medium | O(n) | O(1) | | 57.4% |
| 0226 | Invert Binary Tree | Go | Easy | O(n) | O(1) | | 73.2% |
| 0230 | Kth Smallest Element in a BST | Go | Medium | O(n) | O(1) | | 69.3% |
| 0235 | Lowest Common Ancestor of a Binary Search Tree | Go | Medium | O(n) | O(1) | | 60.1% |
| 0236 | Lowest Common Ancestor of a Binary Tree | Go | Medium | O(n) | O(1) | | 57.9% |
| 0257 | Binary Tree Paths | Go | Easy | O(n) | O(1) | | 60.5% |
| 0297 | Serialize and Deserialize Binary Tree | Go | Hard | | | | 54.9% |
| 0331 | Verify Preorder Serialization of a Binary Tree | Go | Medium | | | | 44.2% |
| 0337 | House Robber III | Go | Medium | | | | 53.8% |
| 0341 | Flatten Nested List Iterator | Go | Medium | | | | 61.5% |
| 0404 | Sum of Left Leaves | Go | Easy | O(n) | O(1) | | 56.2% |
| 0429 | N-ary Tree Level Order Traversal | Go | Medium | | | | 70.6% |
| 0437 | Path Sum III | Go | Medium | O(n) | O(1) | | 48.8% |
| 0508 | Most Frequent Subtree Sum | Go | Medium | | | | 64.3% |
| 0513 | Find Bottom Left Tree Value | Go | Medium | | | | 66.4% |
| 0515 | Find Largest Value in Each Tree Row | Go | Medium | O(n) | O(n) | | 64.6% |
| 0530 | Minimum Absolute Difference in BST | Go | Easy | | | | 56.8% |
| 0538 | Convert BST to Greater Tree | Go | Medium | | | | 67.3% |
| 0543 | Diameter of Binary Tree | Go | Easy | | | | 55.9% |
| 0559 | Maximum Depth of N-ary Tree | Go | Easy | | | | 71.6% |
| 0563 | Binary Tree Tilt | Go | Easy | | | | 59.4% |
| 0572 | Subtree of Another Tree | Go | Easy | | | | 46.0% |
| 0589 | N-ary Tree Preorder Traversal | Go | Easy | | | | 76.3% |
| 0617 | Merge Two Binary Trees | Go | Easy | | | | 78.5% |
| 0623 | Add One Row to Tree | Go | Medium | | | | 59.4% |
| 0637 | Average of Levels in Binary Tree | Go | Easy | O(n) | O(n) | | 71.6% |
| 0653 | Two Sum IV - Input is a BST | Go | Easy | | | | 60.9% |
| 0662 | Maximum Width of Binary Tree | Go | Medium | | | | 40.6% |
| 0669 | Trim a Binary Search Tree | Go | Medium | | | | 66.3% |
| 0700 | Search in a Binary Search Tree | Go | Easy | | | | 77.1% |
| 0701 | Insert into a Binary Search Tree | Go | Medium | | | | 74.6% |
| 0703 | Kth Largest Element in a Stream | Go | Easy | | | | 55.5% |
| 0783 | Minimum Distance Between BST Nodes | Go | Easy | | | | 56.8% |
| 0834 | Sum of Distances in Tree | Go | Hard | | | | 54.2% |
| 0863 | All Nodes Distance K in Binary Tree | Go | Medium | | | | 62.1% |
| 0872 | Leaf-Similar Trees | Go | Easy | | | | 65.2% |
| 0897 | Increasing Order Search Tree | Go | Easy | | | | 78.4% |
| 0938 | Range Sum of BST | Go | Easy | | | | 85.3% |
| 0958 | Check Completeness of a Binary Tree | Go | Medium | | | | 53.8% |
| 0968 | Binary Tree Cameras | Go | Hard | | | | 46.8% |
| 0971 | Flip Binary Tree To Match Preorder Traversal | Go | Medium | | | | 49.9% |
| 0979 | Distribute Coins in Binary Tree | Go | Medium | | | | 72.0% |
| 0987 | Vertical Order Traversal of a Binary Tree | Go | Hard | | | | 44.6% |
| 0993 | Cousins in Binary Tree | Go | Easy | O(n) | O(1) | | 54.1% |
| 1022 | Sum of Root To Leaf Binary Numbers | Go | Easy | | | | 73.8% |
| 1026 | Maximum Difference Between Node and Ancestor | Go | Medium | | | | 73.4% |
| 1028 | Recover a Tree From Preorder Traversal | Go | Hard | | | | 72.8% |
| 1038 | Binary Search Tree to Greater Sum Tree | Go | Medium | | | | 85.4% |
| 1104 | Path In Zigzag Labelled Binary Tree | Go | Medium | | | | 74.9% |
| 1110 | Delete Nodes And Return Forest | Go | Medium | | | | 69.3% |
| 1123 | Lowest Common Ancestor of Deepest Leaves | Go | Medium | | | | 70.6% |
| 1145 | Binary Tree Coloring Game | Go | Medium | | | | 51.4% |
| 1302 | Deepest Leaves Sum | Go | Medium | | | | 86.9% |
| 1305 | All Elements in Two Binary Search Trees | Go | Medium | | | | 79.8% |
| 1600 | Throne Inheritance | Go | Medium | | | | 63.7% |
| 1609 | Even Odd Tree | Go | Medium | | | | 53.7% |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Go | Medium | | | | 48.8% |
| ———— | ——————————————————- | ——- | —————- | ————— | ————- | ————- | ————- |