Tree

Subscribe to see which companies asked this question

You have solved  0/ 60 problems.
# Title Acceptance Difficulty
582 Kill Process 46.0% Medium
572 Subtree of Another Tree 42.5% Easy
563 Binary Tree Tilt 46.9% Easy
549 Binary Tree Longest Consecutive Sequence II 38.4% Medium
545 Boundary of Binary Tree 29.0% Medium
543 Diameter of Binary Tree 42.7% Easy
538 Convert BST to Greater Tree 52.5% Medium
536 Construct Binary Tree from String 38.8% Medium
515 Find Largest Value in Each Tree Row 54.3% Medium
513 Find Bottom Left Tree Value 55.8% Medium
508 Most Frequent Subtree Sum 52.0% Medium
501 Find Mode in Binary Search Tree 38.0% Easy
450 Delete Node in a BST 36.0% Medium
449 Serialize and Deserialize BST 42.0% Medium
437 Path Sum III 39.4% Easy
404 Sum of Left Leaves 46.7% Easy
366 Find Leaves of Binary Tree 58.7% Medium
337 House Robber III 42.7% Medium
333 Largest BST Subtree 30.2% Medium
298 Binary Tree Longest Consecutive Sequence 40.6% Medium
297 Serialize and Deserialize Binary Tree 32.8% Hard
285 Inorder Successor in BST 36.0% Medium
272 Closest Binary Search Tree Value II 38.4% Hard
270 Closest Binary Search Tree Value 39.0% Easy
257 Binary Tree Paths 37.2% Easy
255 Verify Preorder Sequence in Binary Search Tree 39.7% Medium
250 Count Univalue Subtrees 41.3% Medium
236 Lowest Common Ancestor of a Binary Tree 29.6% Medium
235 Lowest Common Ancestor of a Binary Search Tree 38.6% Easy
230 Kth Smallest Element in a BST 43.2% Medium
226 Invert Binary Tree 51.1% Easy
222 Count Complete Tree Nodes 27.2% Medium
199 Binary Tree Right Side View 40.0% Medium
173 Binary Search Tree Iterator 40.5% Medium
156 Binary Tree Upside Down 43.8% Medium
145 Binary Tree Postorder Traversal 39.5% Hard
144 Binary Tree Preorder Traversal 44.3% Medium
129 Sum Root to Leaf Numbers 36.0% Medium
124 Binary Tree Maximum Path Sum 25.6% 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.5% Medium
113 Path Sum II 32.8% Medium
112 Path Sum 33.6% Easy
111 Minimum Depth of Binary Tree 32.8% Easy
110 Balanced Binary Tree 37.0% Easy
108 Convert Sorted Array to Binary Search Tree 41.5% Easy
107 Binary Tree Level Order Traversal II 39.3% Easy
106 Construct Binary Tree from Inorder and Postorder Traversal 31.6% Medium
105 Construct Binary Tree from Preorder and Inorder Traversal 31.6% Medium
104 Maximum Depth of Binary Tree 52.0% Easy
103 Binary Tree Zigzag Level Order Traversal 33.7% Medium
102 Binary Tree Level Order Traversal 38.7% Medium
101 Symmetric Tree 38.1% Easy
100 Same Tree 46.0% Easy
99 Recover Binary Search Tree 29.4% Hard
98 Validate Binary Search Tree 23.0% Medium
96 Unique Binary Search Trees 40.5% Medium
95 Unique Binary Search Trees II 31.1% Medium
94 Binary Tree Inorder Traversal 45.6% Medium
Send Feedback