| 0094 | Binary Tree Inorder Traversal | Go | Easy | | | | 73.8% |
| 0098 | Validate Binary Search Tree | Go | Medium | O(n) | O(1) | | 32.0% |
| 0099 | Recover Binary Search Tree | Go | Medium | O(n) | O(1) | | 51.0% |
| 0100 | Same Tree | Go | Easy | O(n) | O(1) | | 58.2% |
| 0101 | Symmetric Tree | Go | Easy | O(n) | O(1) | | 54.3% |
| 0104 | Maximum Depth of Binary Tree | Go | Easy | O(n) | O(1) | | 73.9% |
| 0110 | Balanced Binary Tree | Go | Easy | O(n) | O(1) | | 49.1% |
| 0111 | Minimum Depth of Binary Tree | Go | Easy | O(n) | O(1) | | 44.5% |
| 0112 | Path Sum | Go | Easy | O(n) | O(1) | | 48.3% |
| 0113 | Path Sum II | Go | Medium | O(n) | O(1) | | 57.1% |
| 0114 | Flatten Binary Tree to Linked List | Go | Medium | O(n) | O(1) | | 61.8% |
| 0116 | Populating Next Right Pointers in Each Node | Go | Medium | | | | 60.4% |
| 0124 | Binary Tree Maximum Path Sum | Go | Hard | O(n) | O(1) | | 39.2% |
| 0129 | Sum Root to Leaf Numbers | Go | Medium | O(n) | O(1) | | 61.0% |
| 0130 | Surrounded Regions | Go | Medium | | | | 36.8% |
| 0144 | Binary Tree Preorder Traversal | Go | Easy | | | | 66.9% |
| 0145 | Binary Tree Postorder Traversal | Go | Easy | | | | 68.0% |
| 0199 | Binary Tree Right Side View | Go | Medium | O(n) | O(1) | | 61.6% |
| 0200 | Number of Islands | Go | Medium | O(n^2) | O(n^2) | | 57.0% |
| 0207 | Course Schedule | Go | Medium | O(n^2) | O(n^2) | | 45.4% |
| 0210 | Course Schedule II | Go | Medium | O(n^2) | O(n^2) | | 48.5% |
| 0211 | Design Add and Search Words Data Structure | Go | Medium | | | | 44.0% |
| 0222 | Count Complete Tree Nodes | Go | Medium | | | | 60.6% |
| 0226 | Invert Binary Tree | Go | Easy | | | | 74.7% |
| 0230 | Kth Smallest Element in a BST | Go | Medium | | | | 70.2% |
| 0235 | Lowest Common Ancestor of a Binary Search Tree | Go | Medium | | | | 61.6% |
| 0236 | Lowest Common Ancestor of a Binary Tree | Go | Medium | | | | 58.8% |
| 0257 | Binary Tree Paths | Go | Easy | O(n) | O(1) | | 61.4% |
| 0297 | Serialize and Deserialize Binary Tree | Go | Hard | | | | 55.4% |
| 0329 | Longest Increasing Path in a Matrix | Go | Hard | | | | 52.4% |
| 0337 | House Robber III | Go | Medium | | | | 53.9% |
| 0341 | Flatten Nested List Iterator | Go | Medium | | | | 61.8% |
| 0385 | Mini Parser | Go | Medium | | | | 36.9% |
| 0386 | Lexicographical Numbers | Go | Medium | | | | 61.6% |
| 0399 | Evaluate Division | Go | Medium | | | | 59.7% |
| 0404 | Sum of Left Leaves | Go | Easy | | | | 56.7% |
| 0417 | Pacific Atlantic Water Flow | Go | Medium | | | | 54.4% |
| 0419 | Battleships in a Board | Go | Medium | | | | 74.8% |
| 0437 | Path Sum III | Go | Medium | | | | 48.0% |
| 0463 | Island Perimeter | Go | Easy | | | | 69.7% |
| 0508 | Most Frequent Subtree Sum | Go | Medium | | | | 64.9% |
| 0513 | Find Bottom Left Tree Value | Go | Medium | | | | 66.9% |
| 0515 | Find Largest Value in Each Tree Row | Go | Medium | O(n) | O(n) | | 64.6% |
| 0529 | Minesweeper | Go | Medium | | | | 65.7% |
| 0530 | Minimum Absolute Difference in BST | Go | Easy | | | | 57.3% |
| 0538 | Convert BST to Greater Tree | Go | Medium | | | | 67.8% |
| 0543 | Diameter of Binary Tree | Go | Easy | | | | 56.8% |
| 0547 | Number of Provinces | Go | Medium | | | | 63.8% |
| 0559 | Maximum Depth of N-ary Tree | Go | Easy | | | | 71.7% |
| 0563 | Binary Tree Tilt | Go | Easy | | | | 60.1% |
| 0572 | Subtree of Another Tree | Go | Easy | | | | 46.4% |
| 0589 | N-ary Tree Preorder Traversal | Go | Easy | | | | 75.8% |
| 0617 | Merge Two Binary Trees | Go | Easy | | | | 78.7% |
| 0623 | Add One Row to Tree | Go | Medium | | | | 59.5% |
| 0637 | Average of Levels in Binary Tree | Go | Easy | | | | 71.7% |
| 0653 | Two Sum IV - Input is a BST | Go | Easy | | | | 61.0% |
| 0662 | Maximum Width of Binary Tree | Go | Medium | | | | 40.7% |
| 0669 | Trim a Binary Search Tree | Go | Medium | | | | 66.4% |
| 0684 | Redundant Connection | Go | Medium | | | | 62.2% |
| 0685 | Redundant Connection II | Go | Hard | | | | 34.1% |
| 0690 | Employee Importance | Go | Medium | | | | 65.6% |
| 0695 | Max Area of Island | Go | Medium | | | | 71.8% |
| 0721 | Accounts Merge | Go | Medium | | | | 56.3% |
| 0733 | Flood Fill | Go | Easy | | | | 62.0% |
| 0753 | Cracking the Safe | Go | Hard | | | | 55.8% |
| 0756 | Pyramid Transition Matrix | Go | Medium | | | | 52.7% |
| 0765 | Couples Holding Hands | Go | Hard | | | | 56.6% |
| 0778 | Swim in Rising Water | Go | Hard | | | | 59.8% |
| 0783 | Minimum Distance Between BST Nodes | Go | Easy | | | | 59.3% |
| 0785 | Is Graph Bipartite? | Go | Medium | | | | 53.1% |
| 0802 | Find Eventual Safe States | Go | Medium | | | | 56.6% |
| 0834 | Sum of Distances in Tree | Go | Hard | | | | 59.1% |
| 0839 | Similar String Groups | Go | Hard | | | | 48.0% |
| 0841 | Keys and Rooms | Go | Medium | | | | 71.5% |
| 0851 | Loud and Rich | Go | Medium | | | | 58.4% |
| 0863 | All Nodes Distance K in Binary Tree | Go | Medium | | | | 62.3% |
| 0872 | Leaf-Similar Trees | Go | Easy | | | | 67.6% |
| 0897 | Increasing Order Search Tree | Go | Easy | | | | 78.4% |
| 0924 | Minimize Malware Spread | Go | Hard | | | | 42.1% |
| 0928 | Minimize Malware Spread II | Go | Hard | | | | 42.8% |
| 0938 | Range Sum of BST | Go | Easy | | | | 85.9% |
| 0947 | Most Stones Removed with Same Row or Column | Go | Medium | | | | 58.9% |
| 0959 | Regions Cut By Slashes | Go | Medium | | | | 69.1% |
| 0968 | Binary Tree Cameras | Go | Hard | | | | 46.6% |
| 0971 | Flip Binary Tree To Match Preorder Traversal | Go | Medium | | | | 50.0% |
| 0979 | Distribute Coins in Binary Tree | Go | Medium | | | | 72.2% |
| 0987 | Vertical Order Traversal of a Binary Tree | Go | Hard | | | | 45.1% |
| 0993 | Cousins in Binary Tree | Go | Easy | | | | 54.6% |
| 1020 | Number of Enclaves | Go | Medium | | | | 65.6% |
| 1022 | Sum of Root To Leaf Binary Numbers | Go | Easy | | | | 73.5% |
| 1026 | Maximum Difference Between Node and Ancestor | Go | Medium | | | | 75.8% |
| 1028 | Recover a Tree From Preorder Traversal | Go | Hard | | | | 73.3% |
| 1034 | Coloring A Border | Go | Medium | | | | 49.2% |
| 1038 | Binary Search Tree to Greater Sum Tree | Go | Medium | | | | 85.5% |
| 1110 | Delete Nodes And Return Forest | Go | Medium | | | | 69.3% |
| 1123 | Lowest Common Ancestor of Deepest Leaves | Go | Medium | | | | 70.9% |
| 1145 | Binary Tree Coloring Game | Go | Medium | | | | 51.7% |
| 1202 | Smallest String With Swaps | Go | Medium | | | | 57.7% |
| 1203 | Sort Items by Groups Respecting Dependencies | Go | Hard | | | | 51.2% |
| 1254 | Number of Closed Islands | Go | Medium | | | | 66.9% |
| 1302 | Deepest Leaves Sum | Go | Medium | | | | 86.6% |
| 1305 | All Elements in Two Binary Search Trees | Go | Medium | | | | 79.8% |
| 1306 | Jump Game III | Go | Medium | | | | 63.5% |
| 1319 | Number of Operations to Make Network Connected | Go | Medium | | | | 62.1% |
| 1600 | Throne Inheritance | Go | Medium | | | | 63.6% |
| 1631 | Path With Minimum Effort | Go | Medium | | | | 55.7% |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Go | Medium | | | | 48.5% |
| ———— | ——————————————————- | ——- | —————- | ————— | ————- | ————- | ————- |