| Find Leaves of Binary Tree | Medium | 81.3% | 77.4% |
| Binary Tree Upside Down | Medium | 65.4% | 69.3% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 66.4% |
| Maximum Depth of Binary Tree | Easy | 77.9% | 63.9% |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 63.0% |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% | 62.1% |
| Symmetric Tree | Easy | 60.8% | 61.0% |
| Closest Binary Search Tree Value II | Hard | 61.1% | 58.8% |
| Second Minimum Node In a Binary Tree | Easy | 46.0% | 58.8% |
| Binary Tree Level Order Traversal | Medium | 72.2% | 56.3% |
| Flatten Nested List Iterator | Medium | 65.6% | 54.9% |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 53.4% |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 50.0% |
| Create Binary Tree From Descriptions | Medium | 81.7% | 50.0% |
| Binary Search Tree Iterator | Medium | 76.2% | 50.0% |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 40.9% |
| Delete Node in a BST | Medium | 54.2% | 32.0% |
| Closest Leaf in a Binary Tree | Medium | 47.4% | 32.0% |
| Diameter of Binary Tree | Easy | 65.1% | 27.8% |
| Same Tree | Easy | 66.7% | 27.8% |
| Validate Binary Search Tree | Medium | 35.4% | 20.8% |
