| Count Univalue Subtrees | Medium | 57.5% |
| Binary Tree Cameras | Hard | 47.6% |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% |
| Maximum Depth of Binary Tree | Easy | 77.9% |
| Binary Tree Right Side View | Medium | 69.5% |
| Flatten Nested List Iterator | Medium | 65.6% |
| Binary Tree Maximum Path Sum | Hard | 42.0% |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% |
| Binary Tree Level Order Traversal | Medium | 72.2% |
| Binary Search Tree Iterator | Medium | 76.2% |
| Kth Largest Element in a Stream | Easy | 60.7% |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% |
| Count Ways to Build Rooms in an Ant Colony | Hard | 51.1% |
| Cousins in Binary Tree | Easy | 59.1% |
| Count Complete Tree Nodes | Easy | 72.1% |
| Trim a Binary Search Tree | Medium | 66.6% |
| Boundary of Binary Tree | Medium | 47.9% |
| Find Diameter Endpoints of a Tree | Medium | 69.8% |
| Smallest Common Region | Medium | 68.3% |
| Path Sum IV | Medium | 62.8% |
| Binary Tree Inorder Traversal | Easy | 79.7% |
| Create Binary Tree From Descriptions | Medium | 81.7% |
| Number of Ways to Assign Edge Weights I | Medium | |
| Balanced Binary Tree | Easy | 57.9% |
| Symmetric Tree | Easy | 60.8% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% |
| Convert Sorted List to Binary Search Tree | Medium | 66.0% |
| Same Tree | Easy | 66.7% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% |
| Diameter of Binary Tree | Easy | 65.1% |
| Maximum Width of Binary Tree | Medium | 45.3% |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% |
| Binary Tree Preorder Traversal | Easy | 75.2% |
| Validate Binary Search Tree | Medium | 35.4% |
| Recover Binary Search Tree | Medium | 58.8% |
| Construct Binary Search Tree from Preorder Traversal | Medium | 84.1% |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% |
| Kth Largest Sum in a Binary Tree | Medium | 59.0% |
| Recover a Tree From Preorder Traversal | Hard | 83.2% |
| House Robber III | Medium | 55.6% |
| Insert into a Binary Search Tree | Medium | 73.4% |
| Distribute Coins in Binary Tree | Medium | 77.3% |
| Minimum Depth of Binary Tree | Easy | 52.4% |
| Path Sum III | Medium | 46.3% |
| Maximum Level Sum of a Binary Tree | Medium | 70.0% |
| Balance a Binary Search Tree | Medium | 86.3% |
| Flatten Binary Tree to Linked List | Medium | 70.2% |
| Two Sum IV - Input is a BST | Easy | 63.0% |
| Invert Binary Tree | Easy | 79.8% |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.1% |
| Maximum Product of Splitted Binary Tree | Medium | 55.5% |
| Serialize and Deserialize BST | Medium | 59.4% |
| Unique Binary Search Trees | Medium | 63.3% |
| Minimum Absolute Difference in BST | Easy | 59.2% |
| Binary Tree Level Order Traversal II | Medium | 67.7% |
| Count Good Nodes in Binary Tree | Medium | 73.8% |
| Smallest String Starting From Leaf | Medium | 61.1% |
| Path Sum II | Medium | 61.8% |
| Time Needed to Inform All Employees | Medium | 60.4% |
| Delete Nodes And Return Forest | Medium | 72.5% |
| Populating Next Right Pointers in Each Node | Medium | 66.9% |
| Minimum Fuel Cost to Report to the Capital | Medium | 64.9% |
| Subtree of Another Tree | Easy | 51.3% |
| Path Sum | Easy | 54.5% |
| Delete Node in a BST | Medium | 54.2% |
| Average of Levels in Binary Tree | Easy | 74.7% |
| Range Sum of BST | Easy | 87.6% |
| Merge BSTs to Create Single BST | Hard | 38.0% |
| Kth Smallest Element in a BST | Medium | 76.5% |
| Binary Tree Vertical Order Traversal | Medium | 57.8% |
| Maximum Sum BST in Binary Tree | Hard | 46.5% |
| Sum Root to Leaf Numbers | Medium | 69.6% |
| Serialize and Deserialize N-ary Tree | Hard | 68.6% |
| Unique Binary Search Trees II | Medium | 62.0% |
| Binary Tree Postorder Traversal | Easy | 77.6% |
| Binary Tree Paths | Easy | 68.2% |
| Merge Two Binary Trees | Easy | 79.0% |
| Populating Next Right Pointers in Each Node II | Medium | 57.1% |
| Sum of Left Leaves | Easy | 62.4% |
| Find Duplicate Subtrees | Medium | 60.6% |
| Search in a Binary Search Tree | Easy | 82.5% |
| Binary Search Tree to Greater Sum Tree | Medium | 88.4% |
| Cousins in Binary Tree II | Medium | 75.8% |
| Find Largest Value in Each Tree Row | Medium | 66.3% |
| Convert BST to Greater Tree | Medium | 71.4% |
| Maximum Difference Between Node and Ancestor | Medium | 78.1% |
| Lowest Common Ancestor of a Binary Tree IV | Medium | 79.5% |
| Step-By-Step Directions From a Binary Tree Node to Another | Medium | 56.4% |
| Root Equals Sum of Children | Easy | 84.9% |
| Minimum Number of Operations to Sort a Binary Tree by Level | Medium | 74.2% |
| Design an Expression Tree With Evaluate Function | Medium | 82.5% |
| Even Odd Tree | Medium | 67.0% |
| Construct Quad Tree | Medium | 78.1% |
| All Possible Full Binary Trees | Medium | 82.7% |
| Clone Binary Tree With Random Pointer | Medium | 80.9% |
| Most Frequent Subtree Sum | Medium | 68.9% |
| N-ary Tree Postorder Traversal | Easy | 81.0% |