| Number of Islands | Medium | 63.8% | 86.0% |
| Course Schedule | Medium | 50.8% | 74.7% |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 70.1% |
| Course Schedule II | Medium | 55.0% | 65.8% |
| Word Search | Medium | 46.9% | 65.2% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 58.9% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 57.5% |
| Binary Tree Right Side View | Medium | 69.5% | 56.8% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 56.3% |
| Concatenated Words | Hard | 49.7% | 53.6% |
| Flood Fill | Easy | 67.9% | 53.3% |
| Validate Binary Search Tree | Medium | 35.4% | 53.0% |
| Diameter of Binary Tree | Easy | 65.1% | 52.3% |
| Number of Provinces | Medium | 70.0% | 50.7% |
| Evaluate Division | Medium | 64.0% | 50.3% |
| Balanced Binary Tree | Easy | 57.9% | 49.9% |
| Symmetric Tree | Easy | 60.8% | 47.6% |
| Maximum Depth of Binary Tree | Easy | 77.9% | 47.2% |
| Same Tree | Easy | 66.7% | 46.7% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 46.3% |
| Maximum Width of Binary Tree | Medium | 45.3% | 46.3% |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% | 46.3% |
| Surrounded Regions | Medium | 44.8% | 45.3% |
| Pacific Atlantic Water Flow | Medium | 60.6% | 44.9% |
| Populating Next Right Pointers in Each Node | Medium | 66.9% | 44.9% |
| Kth Smallest Element in a BST | Medium | 76.5% | 44.4% |
| Cheapest Flights Within K Stops | Medium | 41.4% | 43.3% |
| House Robber III | Medium | 55.6% | 42.8% |
| Invert Binary Tree | Easy | 79.8% | 42.8% |
| Critical Connections in a Network | Hard | 59.3% | 41.6% |
| Binary Tree Inorder Traversal | Easy | 79.7% | 39.8% |
| Accounts Merge | Medium | 60.9% | 39.8% |
| Making A Large Island | Hard | 56.3% | 39.8% |
| Max Area of Island | Medium | 73.8% | 38.4% |
| Clone Graph | Medium | 64.7% | 37.7% |
| Recover Binary Search Tree | Medium | 58.8% | 37.7% |
| Number of Distinct Islands | Medium | 62.7% | 37.7% |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 36.9% |
| Alien Dictionary | Hard | 37.1% | 36.9% |
| Design Add and Search Words Data Structure | Medium | 48.2% | 36.9% |
| Flatten Binary Tree to Linked List | Medium | 70.2% | 36.9% |
| Is Graph Bipartite? | Medium | 58.9% | 36.1% |
| Maximum Sum BST in Binary Tree | Hard | 46.5% | 36.1% |
| Number of Connected Components in an Undirected Graph | Medium | 64.8% | 35.3% |
| Boundary of Binary Tree | Medium | 47.9% | 35.3% |
| Binary Tree Cameras | Hard | 47.6% | 34.4% |
| Find Eventual Safe States | Medium | 70.3% | 34.4% |
| Path Sum III | Medium | 46.3% | 33.5% |
| Balance a Binary Search Tree | Medium | 86.3% | 33.5% |
| Reconstruct Itinerary | Hard | 44.3% | 33.5% |
| Two Sum IV - Input is a BST | Easy | 63.0% | 32.5% |
| Merge Two Binary Trees | Easy | 79.0% | 32.5% |
| Flatten a Multilevel Doubly Linked List | Medium | 62.6% | 31.5% |
| Path Sum | Easy | 54.5% | 31.5% |
| Binary Search Tree to Greater Sum Tree | Medium | 88.4% | 31.5% |
| Recover a Tree From Preorder Traversal | Hard | 83.2% | 30.4% |
| Cousins in Binary Tree II | Medium | 75.8% | 30.4% |
| Loud and Rich | Medium | 63.2% | 30.4% |
| Path Sum II | Medium | 61.8% | 29.3% |
| Convert BST to Greater Tree | Medium | 71.4% | 29.3% |
| Maximum Difference Between Node and Ancestor | Medium | 78.1% | 29.3% |
| Lowest Common Ancestor of a Binary Tree IV | Medium | 79.5% | 29.3% |
| Clone Binary Tree With Random Pointer | Medium | 80.9% | 29.3% |
| Most Frequent Subtree Sum | Medium | 68.9% | 29.3% |
| Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 49.8% | 29.3% |
| Find if Path Exists in Graph | Easy | 54.8% | 28.0% |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 28.0% |
| Serialize and Deserialize BST | Medium | 59.4% | 28.0% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 28.0% |
| Keys and Rooms | Medium | 75.5% | 28.0% |
| Minesweeper | Medium | 68.7% | 28.0% |
| Number of Distinct Islands II | Hard | 55.3% | 28.0% |
| Sum of Root To Leaf Binary Numbers | Easy | 76.6% | 28.0% |
| Number of Operations to Make Network Connected | Medium | 66.2% | 26.7% |
| Network Delay Time | Medium | 59.8% | 26.7% |
| All Paths From Source to Target | Medium | 83.5% | 26.7% |
| Redundant Connection | Medium | 67.3% | 26.7% |
| Flatten Nested List Iterator | Medium | 65.6% | 26.7% |
| Subtree of Another Tree | Easy | 51.3% | 26.7% |
| Binary Tree Vertical Order Traversal | Medium | 57.8% | 26.7% |
| Sum Root to Leaf Numbers | Medium | 69.6% | 26.7% |
| Check for Contradictions in Equations | Hard | 43.8% | 26.7% |
| Path With Maximum Minimum Value | Medium | 54.6% | 26.7% |
| Two Sum BSTs | Medium | 68.2% | 26.7% |
| Sum of Nodes with Even-Valued Grandparent | Medium | 85.9% | 26.7% |
| Battleships in a Board | Medium | 77.4% | 25.3% |
| Lexicographical Numbers | Medium | 76.2% | 25.3% |
| Serialize and Deserialize N-ary Tree | Hard | 68.6% | 25.3% |
| Nested List Weight Sum | Medium | 85.9% | 25.3% |
| Design Search Autocomplete System | Hard | 49.7% | 25.3% |
| Swim in Rising Water | Hard | 67.6% | 25.3% |
| Construct String from Binary Tree | Medium | 70.6% | 25.3% |
| All Elements in Two Binary Search Trees | Medium | 80.2% | 25.3% |
| Find Distance in a Binary Tree | Medium | 74.3% | 25.3% |
| Find Number of Coins to Place in Tree Nodes | Hard | 37.3% | 25.3% |
| Minimum Score After Removals on a Tree | Hard | 76.2% | 25.3% |
| Delete Leaves With a Given Value | Medium | 77.3% | 25.3% |
| Insufficient Nodes in Root to Leaf Paths | Medium | 54.9% | 25.3% |
| Distribute Coins in Binary Tree | Medium | 77.3% | 23.7% |
| Reorder Routes to Make All Paths Lead to the City Zero | Medium | 65.6% | 23.7% |
| Shortest Bridge | Medium | 59.3% | 23.7% |
| Count Servers that Communicate | Medium | 73.5% | 23.7% |
| Pseudo-Palindromic Paths in a Binary Tree | Medium | 68.4% | 23.7% |
| Construct Binary Tree from String | Medium | 58.7% | 23.7% |
| Maximum Average Subtree | Medium | 66.9% | 23.7% |
| Clone N-ary Tree | Medium | 83.1% | 23.7% |
| Equal Tree Partition | Medium | 42.3% | 23.7% |
| Minimum Operations to Remove Adjacent Ones in Matrix | Hard | 42.9% | 23.7% |
| Closest Leaf in a Binary Tree | Medium | 47.4% | 23.7% |
| Binary Tree Preorder Traversal | Easy | 75.2% | 22.0% |
| Island Perimeter | Easy | 74.3% | 22.0% |
| Minimum Fuel Cost to Report to the Capital | Medium | 64.9% | 22.0% |
| Path With Minimum Effort | Medium | 62.8% | 22.0% |
| Course Schedule IV | Medium | 59.7% | 22.0% |
| Binary Tree Postorder Traversal | Easy | 77.6% | 22.0% |
| Binary Tree Paths | Easy | 68.2% | 22.0% |
| Remove Sub-Folders from the Filesystem | Medium | 78.6% | 22.0% |
| Minimum Height Trees | Medium | 42.4% | 20.2% |
| Minimum Depth of Binary Tree | Easy | 52.4% | 20.2% |
| Populating Next Right Pointers in Each Node II | Medium | 57.1% | 20.2% |
| Find Duplicate Subtrees | Medium | 60.6% | 20.2% |
| Total Sum of Interaction Cost in Tree Groups | Hard | 53.5% | 20.2% |
| Detect Cycles in 2D Grid | Medium | 52.5% | 18.1% |
| Possible Bipartition | Medium | 52.4% | 18.1% |
| Count Good Nodes in Binary Tree | Medium | 73.8% | 18.1% |
| Detonate the Maximum Bombs | Medium | 49.9% | 18.1% |
| Sum of Left Leaves | Easy | 62.4% | 18.1% |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 18.1% |
| Trim a Binary Search Tree | Medium | 66.6% | 18.1% |
| Lexicographically Smallest String After Applying Operations | Medium | 79.4% | 18.1% |
| Maximum Level Sum of a Binary Tree | Medium | 70.0% | 15.8% |
| Maximum Product of Splitted Binary Tree | Medium | 55.5% | 15.8% |
| Range Sum of BST | Easy | 87.6% | 15.8% |
| Regions Cut By Slashes | Medium | 77.5% | 15.8% |
| Step-By-Step Directions From a Binary Tree Node to Another | Medium | 56.4% | 15.8% |
| Water and Jug Problem | Medium | 45.0% | 15.8% |
| Count the Number of Complete Components | Medium | 77.8% | 15.8% |
| Find Closest Node to Given Two Nodes | Medium | 53.0% | 13.3% |
| Cousins in Binary Tree | Easy | 59.1% | 13.3% |
| N-ary Tree Postorder Traversal | Easy | 81.0% | 13.3% |
| Tree Diameter | Medium | 61.3% | 13.3% |
| Last Day Where You Can Still Cross | Hard | 68.6% | 13.3% |
| Kill Process | Medium | 70.3% | 13.3% |
| Web Crawler | Medium | 68.8% | 10.4% |
| Jump Game III | Medium | 66.7% | 10.4% |
| Smallest String Starting From Leaf | Medium | 61.1% | 10.4% |
| Delete Nodes And Return Forest | Medium | 72.5% | 10.4% |
| Average of Levels in Binary Tree | Easy | 74.7% | 10.4% |
| Find Leaves of Binary Tree | Medium | 81.3% | 10.4% |
| Leaf-Similar Trees | Easy | 70.2% | 10.4% |
| Increasing Order Search Tree | Easy | 78.9% | 10.4% |
| Maximum Employees to Be Invited to a Meeting | Hard | 61.8% | 10.4% |
| Check if the Rectangle Corner Is Reachable | Hard | 25.3% | 10.4% |
| All Ancestors of a Node in a Directed Acyclic Graph | Medium | 62.1% | 10.4% |
| Most Profitable Path in a Tree | Medium | 67.3% | 10.4% |
| Count Univalue Subtrees | Medium | 57.5% | 10.4% |
| Find Bottom Left Tree Value | Medium | 72.2% | 10.4% |
| Number of Ways to Assign Edge Weights I | Medium | | 7.2% |
| Minimum Absolute Difference in BST | Easy | 59.2% | 7.2% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 7.2% |
| Mini Parser | Medium | 42.0% | 7.2% |
| Time Needed to Inform All Employees | Medium | 60.4% | 7.2% |
| Merge BSTs to Create Single BST | Hard | 38.0% | 7.2% |
| Kth Ancestor of a Tree Node | Hard | 37.2% | 7.2% |
| Minimum Number of Days to Disconnect Island | Hard | 58.8% | 7.2% |
| Graph Valid Tree | Medium | 49.8% | 7.2% |
| The Maze | Medium | 60.3% | 7.2% |
| Binary Tree Pruning | Medium | 72.5% | 7.2% |
| Maximum Number of Fish in a Grid | Medium | 70.5% | 7.2% |
| Employee Importance | Medium | 69.3% | 7.2% |
| N-ary Tree Preorder Traversal | Easy | 76.7% | 7.2% |
| Longest Cycle in a Graph | Hard | 50.5% | 7.2% |
| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% | 7.2% |
| Sentence Similarity II | Medium | 51.1% | 7.2% |
| Minimum Distance Between BST Nodes | Easy | 61.1% | 7.2% |
| Power Grid Maintenance | Medium | 56.3% | 7.2% |
| Longest Path With Different Adjacent Characters | Hard | 54.0% | 7.2% |
| Closest Binary Search Tree Value II | Hard | 61.1% | 7.2% |
| Longest Absolute File Path | Medium | 49.2% | 7.2% |
| Minimum Time to Collect All Apples in a Tree | Medium | 63.6% | 7.2% |
| Escape a Large Maze | Hard | 36.3% | 7.2% |
| Binary Tree Tilt | Easy | 65.4% | 7.2% |
| Minimize Malware Spread | Hard | 43.0% | 7.2% |
| Count Nodes Equal to Average of Subtree | Medium | 86.7% | 7.2% |
| Find Mode in Binary Search Tree | Easy | 58.5% | 7.2% |
| Sum of Distances in Tree | Hard | 65.5% | 5.0% |
| Flip Equivalent Binary Trees | Medium | 69.6% | 5.0% |
| Number of Enclaves | Medium | 71.5% | 5.0% |
| Number of Closed Islands | Medium | 67.0% | 5.0% |
| Longest ZigZag Path in a Binary Tree | Medium | 67.0% | 5.0% |
| Find Elements in a Contaminated Binary Tree | Medium | 84.1% | 5.0% |
| Linked List in Binary Tree | Medium | 51.9% | 5.0% |
| Valid Arrangement of Pairs | Hard | 66.5% | 5.0% |
| Find a Corresponding Node of a Binary Tree in a Clone of That Tree | Easy | 85.8% | 5.0% |
| Count Nodes With the Highest Score | Medium | 52.5% | 5.0% |
| Maximum Number of K-Divisible Components | Hard | 74.1% | 5.0% |
| Minimum Score of a Path Between Two Cities | Medium | 58.6% | 5.0% |
| Binary Tree Longest Consecutive Sequence | Medium | 54.6% | 5.0% |
| Convert Binary Search Tree to Sorted Doubly Linked List | Medium | 65.6% | 5.0% |
| Delete Duplicate Folders in System | Hard | 77.7% | 5.0% |
| Maximum Depth of N-ary Tree | Easy | 73.5% | 5.0% |
| Lowest Common Ancestor of Deepest Leaves | Medium | 79.4% | 5.0% |
| Inorder Successor in BST | Medium | 51.1% | 5.0% |
| The Maze II | Medium | 55.0% | 5.0% |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 5.0% |
| Binary Tree Coloring Game | Medium | 52.9% | 5.0% |
| Sum of Perfect Square Ancestors | Hard | 42.5% | 5.0% |
| Print Binary Tree | Medium | 66.4% | 5.0% |
| Smallest Subtree with all the Deepest Nodes | Medium | 77.5% | 5.0% |
| Find All People With Secret | Hard | 48.4% | 5.0% |
| Operations on Tree | Medium | 45.0% | 5.0% |
| Similar String Groups | Hard | 56.1% | 5.0% |
| Check Knight Tour Configuration | Medium | 60.6% | 5.0% |
| Restore the Array From Adjacent Pairs | Medium | 75.1% | 5.0% |
| Array Nesting | Medium | 56.5% | 5.0% |
| Longest Univalue Path | Medium | 43.6% | 5.0% |
| Properties Graph | Medium | | 5.0% |
| Number of Ways to Assign Edge Weights II | Hard | | 5.0% |
