| Number of Islands | Medium | 63.8% | 84.2% |
| Flatten a Multilevel Doubly Linked List | Medium | 62.6% | 78.8% |
| Word Search | Medium | 46.9% | 78.2% |
| Validate Binary Search Tree | Medium | 35.4% | 65.2% |
| All Paths From Source to Target | Medium | 83.5% | 60.7% |
| Evaluate Division | Medium | 64.0% | 60.2% |
| Binary Tree Vertical Order Traversal | Medium | 57.8% | 57.1% |
| Symmetric Tree | Easy | 60.8% | 54.8% |
| Balanced Binary Tree | Easy | 57.9% | 54.8% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 54.8% |
| Number of Provinces | Medium | 70.0% | 54.1% |
| Same Tree | Easy | 66.7% | 52.1% |
| Populating Next Right Pointers in Each Node | Medium | 66.9% | 52.1% |
| Lexicographical Numbers | Medium | 76.2% | 51.3% |
| Kth Smallest Element in a BST | Medium | 76.5% | 50.5% |
| Populating Next Right Pointers in Each Node II | Medium | 57.1% | 48.9% |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 48.0% |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% | 47.1% |
| Diameter of Binary Tree | Easy | 65.1% | 45.1% |
| Maximum Depth of Binary Tree | Easy | 77.9% | 45.1% |
| Course Schedule | Medium | 50.8% | 45.1% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 45.1% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 44.0% |
| Implement Magic Dictionary | Medium | 57.7% | 42.9% |
| Surrounded Regions | Medium | 44.8% | 41.7% |
| Binary Tree Right Side View | Medium | 69.5% | 41.7% |
| Course Schedule II | Medium | 55.0% | 40.4% |
| Binary Tree Inorder Traversal | Easy | 79.7% | 40.4% |
| Flatten Binary Tree to Linked List | Medium | 70.2% | 40.4% |
| Kill Process | Medium | 70.3% | 40.4% |
| Accounts Merge | Medium | 60.9% | 39.0% |
| Path Sum II | Medium | 61.8% | 39.0% |
| Cousins in Binary Tree | Easy | 59.1% | 37.5% |
| Trim a Binary Search Tree | Medium | 66.6% | 37.5% |
| Minimum Depth of Binary Tree | Easy | 52.4% | 35.9% |
| Redundant Connection | Medium | 67.3% | 34.1% |
| Flood Fill | Easy | 67.9% | 34.1% |
| Maximum Width of Binary Tree | Medium | 45.3% | 34.1% |
| Contain Virus | Hard | 54.4% | 34.1% |
| Maximum Number of Accepted Invitations | Medium | 52.3% | 34.1% |
| Find if Path Exists in Graph | Easy | 54.8% | 32.2% |
| Invert Binary Tree | Easy | 79.8% | 32.2% |
| Design Search Autocomplete System | Hard | 49.7% | 32.2% |
| Find Eventual Safe States | Medium | 70.3% | 32.2% |
| Serialize and Deserialize N-ary Tree | Hard | 68.6% | 30.0% |
| Island Perimeter | Easy | 74.3% | 30.0% |
| Path Sum | Easy | 54.5% | 27.6% |
| Max Area of Island | Medium | 73.8% | 27.6% |
| Recover Binary Search Tree | Medium | 58.8% | 27.6% |
| Clone Graph | Medium | 64.7% | 27.6% |
| Making A Large Island | Hard | 56.3% | 27.6% |
| Sum of Root To Leaf Binary Numbers | Easy | 76.6% | 24.9% |
| Reconstruct Itinerary | Hard | 44.3% | 24.9% |
| Cheapest Flights Within K Stops | Medium | 41.4% | 24.9% |
| Critical Connections in a Network | Hard | 59.3% | 24.9% |
| Binary Tree Preorder Traversal | Easy | 75.2% | 24.9% |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 24.9% |
| Couples Holding Hands | Hard | 59.2% | 24.9% |
| Two Sum IV - Input is a BST | Easy | 63.0% | 24.9% |
| Sum Root to Leaf Numbers | Medium | 69.6% | 21.7% |
| Number of Enclaves | Medium | 71.5% | 21.7% |
| Subtree of Another Tree | Easy | 51.3% | 21.7% |
| Design Add and Search Words Data Structure | Medium | 48.2% | 21.7% |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 21.7% |
| Binary Tree Postorder Traversal | Easy | 77.6% | 21.7% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 21.7% |
| Find Root of N-Ary Tree | Medium | 78.6% | 21.7% |
| Balance a Binary Search Tree | Medium | 86.3% | 18.0% |
| Find Bottom Left Tree Value | Medium | 72.2% | 18.0% |
| Count Servers that Communicate | Medium | 73.5% | 18.0% |
| Path With Minimum Effort | Medium | 62.8% | 18.0% |
| Binary Tree Cameras | Hard | 47.6% | 18.0% |
| Maximum Product of Splitted Binary Tree | Medium | 55.5% | 18.0% |
| Network Delay Time | Medium | 59.8% | 18.0% |
| Number of Ways to Assign Edge Weights II | Hard | | 13.6% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 13.6% |
| Flatten Nested List Iterator | Medium | 65.6% | 13.6% |
| Binary Tree Paths | Easy | 68.2% | 13.6% |
| Sum of Left Leaves | Easy | 62.4% | 13.6% |
| Find Duplicate Subtrees | Medium | 60.6% | 13.6% |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 13.6% |
| Path Sum III | Medium | 46.3% | 13.6% |
| Minimum Number of Days to Disconnect Island | Hard | 58.8% | 13.6% |
| N-ary Tree Postorder Traversal | Easy | 81.0% | 13.6% |
| Minimum Height Trees | Medium | 42.4% | 13.6% |
| Pacific Atlantic Water Flow | Medium | 60.6% | 13.6% |
| Merge Two Binary Trees | Easy | 79.0% | 13.6% |
| Recover a Tree From Preorder Traversal | Hard | 83.2% | 13.6% |
| Minimum Score of a Path Between Two Cities | Medium | 58.6% | 13.6% |
| Lowest Common Ancestor of Deepest Leaves | Medium | 79.4% | 13.6% |
| Number of Operations to Make Network Connected | Medium | 66.2% | 13.6% |
| Range Sum of BST | Easy | 87.6% | 13.6% |
| House Robber III | Medium | 55.6% | 13.6% |
| Smallest Subtree with all the Deepest Nodes | Medium | 77.5% | 13.6% |
| Number of Distinct Islands | Medium | 62.7% | 13.6% |
| Minimize Hamming Distance After Swap Operations | Medium | 49.2% | 8.4% |
| Employee Importance | Medium | 69.3% | 8.4% |
| Alien Dictionary | Hard | 37.1% | 8.4% |
| Find Mode in Binary Search Tree | Easy | 58.5% | 8.4% |
| Distribute Coins in Binary Tree | Medium | 77.3% | 8.4% |
| Flower Planting With No Adjacent | Medium | 53.4% | 8.4% |
| Linked List in Binary Tree | Medium | 51.9% | 8.4% |
| Most Frequent Subtree Sum | Medium | 68.9% | 8.4% |
| Regions Cut By Slashes | Medium | 77.5% | 8.4% |
| Count Univalue Subtrees | Medium | 57.5% | 8.4% |
| Remove Methods From Project | Medium | 50.4% | 8.4% |
| Shortest Path in a Hidden Grid | Medium | 44.5% | 8.4% |
| Longest Univalue Path | Medium | 43.6% | 8.4% |
| Find Closest Node to Given Two Nodes | Medium | 53.0% | 8.4% |
| Construct Binary Tree from String | Medium | 58.7% | 8.4% |
| Is Graph Bipartite? | Medium | 58.9% | 8.4% |
| The Maze | Medium | 60.3% | 8.4% |
| Delete Duplicate Folders in System | Hard | 77.7% | 8.4% |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 8.4% |
| Smallest String With Swaps | Medium | 60.4% | 8.4% |
| Add One Row to Tree | Medium | 64.1% | 8.4% |
| Maximum Difference Between Node and Ancestor | Medium | 78.1% | 8.4% |
| Battleships in a Board | Medium | 77.4% | 8.4% |
| Maximum Sum BST in Binary Tree | Hard | 46.5% | 8.4% |
| Closest Binary Search Tree Value | Easy | 49.3% | 8.4% |
| Mini Parser | Medium | 42.0% | 8.4% |
