Tree

Subscribe to see which companies asked this question

You have solved  0/ 64 problems.
# Title Acceptance Difficulty
637 Average of Levels in Binary Tree 57.7% Easy
623 Add One Row to Tree 47.2% Medium
617 Merge Two Binary Trees 68.7% Easy
606 Construct String from Binary Tree 51.1% Easy
582 Kill Process 48.4% Medium
572 Subtree of Another Tree 40.7% Easy
563 Binary Tree Tilt 47.0% Easy
549 Binary Tree Longest Consecutive Sequence II 39.6% Medium
545 Boundary of Binary Tree 30.8% Medium
543 Diameter of Binary Tree 43.5% Easy
538 Convert BST to Greater Tree 51.4% Easy
536 Construct Binary Tree from String 40.2% Medium
515 Find Largest Value in Each Tree Row 54.8% Medium
513 Find Bottom Left Tree Value 55.6% Medium
508 Most Frequent Subtree Sum 52.2% Medium
501 Find Mode in Binary Search Tree 38.1% Easy
450 Delete Node in a BST 36.5% Medium
449 Serialize and Deserialize BST 42.3% Medium
437 Path Sum III 39.8% Easy
404 Sum of Left Leaves 46.9% Easy
366 Find Leaves of Binary Tree 59.3% Medium
337 House Robber III 43.2% Medium
333 Largest BST Subtree 30.4% Medium
298 Binary Tree Longest Consecutive Sequence 40.8% Medium
297 Serialize and Deserialize Binary Tree 33.1% Hard
285 Inorder Successor in BST 36.0% Medium
272 Closest Binary Search Tree Value II 38.7% Hard
270 Closest Binary Search Tree Value 39.3% Easy
257 Binary Tree Paths 38.0% Easy
255 Verify Preorder Sequence in Binary Search Tree 40.1% Medium
250 Count Univalue Subtrees 41.8% Medium
236 Lowest Common Ancestor of a Binary Tree 29.7% Medium
235 Lowest Common Ancestor of a Binary Search Tree 38.9% Easy
230 Kth Smallest Element in a BST 43.6% Medium
226 Invert Binary Tree 51.6% Easy
222 Count Complete Tree Nodes 27.4% Medium
199 Binary Tree Right Side View 40.6% Medium
173 Binary Search Tree Iterator 41.1% Medium
156 Binary Tree Upside Down 44.2% Medium
145 Binary Tree Postorder Traversal 40.0% Hard
144 Binary Tree Preorder Traversal 44.8% Medium
129 Sum Root to Leaf Numbers 36.5% Medium
124 Binary Tree Maximum Path Sum 26.0% Hard
117 Populating Next Right Pointers in Each Node II 33.7% Medium
116 Populating Next Right Pointers in Each Node 36.9% Medium
114 Flatten Binary Tree to Linked List 34.9% Medium
113 Path Sum II 33.4% Medium
112 Path Sum 33.9% Easy
111 Minimum Depth of Binary Tree 33.0% Easy
110 Balanced Binary Tree 37.3% Easy
108 Convert Sorted Array to Binary Search Tree 42.0% Easy
107 Binary Tree Level Order Traversal II 39.9% Easy
106 Construct Binary Tree from Inorder and Postorder Traversal 32.0% Medium
105 Construct Binary Tree from Preorder and Inorder Traversal 32.1% Medium
104 Maximum Depth of Binary Tree 52.5% Easy
103 Binary Tree Zigzag Level Order Traversal 34.3% Medium
102 Binary Tree Level Order Traversal 39.4% Medium
101 Symmetric Tree 38.6% Easy
100 Same Tree 46.4% Easy
99 Recover Binary Search Tree 29.8% Hard
98 Validate Binary Search Tree 23.2% Medium
96 Unique Binary Search Trees 40.8% Medium
95 Unique Binary Search Trees II 31.3% Medium
94 Binary Tree Inorder Traversal 46.3% Medium
  Send Feedback