Tree

Subscribe to see which companies asked this question

You have solved  0/ 77 problems.
# Title Acceptance Difficulty
731 My Calendar II 32.0% Medium
687 Longest Univalue Path 33.3% Easy
685 Redundant Connection II 28.4% Hard
684 Redundant Connection 39.2% Medium
671 Second Minimum Node In a Binary Tree 41.8% Easy
669 Trim a Binary Search Tree 57.9% Easy
666 Path Sum IV 49.2% Medium
663 Equal Tree Partition 36.6% Medium
662 Maximum Width of Binary Tree 38.1% Medium
655 Print Binary Tree 50.0% Medium
654 Maximum Binary Tree 69.9% Medium
653 Two Sum IV - Input is a BST 50.4% Easy
652 Find Duplicate Subtrees 35.8% Medium
637 Average of Levels in Binary Tree 55.6% Easy
623 Add One Row to Tree 46.6% Medium
617 Merge Two Binary Trees 67.6% Easy
606 Construct String from Binary Tree 49.7% Easy
582 Kill Process 49.8% Medium
572 Subtree of Another Tree 40.6% Easy
563 Binary Tree Tilt 47.1% Easy
549 Binary Tree Longest Consecutive Sequence II 41.9% Medium
545 Boundary of Binary Tree 31.9% Medium
543 Diameter of Binary Tree 44.7% Easy
538 Convert BST to Greater Tree 49.1% Easy
536 Construct Binary Tree from String 42.8% Medium
515 Find Largest Value in Each Tree Row 55.1% Medium
513 Find Bottom Left Tree Value 56.1% Medium
508 Most Frequent Subtree Sum 52.2% Medium
501 Find Mode in Binary Search Tree 37.7% Easy
450 Delete Node in a BST 37.2% Medium
449 Serialize and Deserialize BST 42.4% Medium
437 Path Sum III 40.1% Easy
404 Sum of Left Leaves 47.3% Easy
366 Find Leaves of Binary Tree 60.3% Medium
337 House Robber III 44.0% Medium
333 Largest BST Subtree 30.6% Medium
298 Binary Tree Longest Consecutive Sequence 41.4% Medium
297 Serialize and Deserialize Binary Tree 34.0% Hard
285 Inorder Successor in BST 36.3% Medium
272 Closest Binary Search Tree Value II 39.4% Hard
270 Closest Binary Search Tree Value 40.1% Easy
257 Binary Tree Paths 39.7% Easy
255 Verify Preorder Sequence in Binary Search Tree 40.7% Medium
250 Count Univalue Subtrees 42.8% Medium
236 Lowest Common Ancestor of a Binary Tree 30.0% Medium
235 Lowest Common Ancestor of a Binary Search Tree 39.5% Easy
230 Kth Smallest Element in a BST 44.5% Medium
226 Invert Binary Tree 52.5% Easy
222 Count Complete Tree Nodes 27.6% Medium
199 Binary Tree Right Side View 41.6% Medium
173 Binary Search Tree Iterator 42.4% Medium
156 Binary Tree Upside Down 45.1% Medium
145 Binary Tree Postorder Traversal 40.9% Hard
144 Binary Tree Preorder Traversal 45.7% Medium
129 Sum Root to Leaf Numbers 37.2% Medium
124 Binary Tree Maximum Path Sum 26.6% Hard
117 Populating Next Right Pointers in Each Node II 33.8% Medium
116 Populating Next Right Pointers in Each Node 36.9% Medium
114 Flatten Binary Tree to Linked List 35.7% Medium
113 Path Sum II 34.6% Medium
112 Path Sum 34.4% Easy
111 Minimum Depth of Binary Tree 33.3% Easy
110 Balanced Binary Tree 37.9% Easy
108 Convert Sorted Array to Binary Search Tree 42.7% Easy
107 Binary Tree Level Order Traversal II 41.0% Easy
106 Construct Binary Tree from Inorder and Postorder Traversal 32.6% Medium
105 Construct Binary Tree from Preorder and Inorder Traversal 32.8% Medium
104 Maximum Depth of Binary Tree 53.4% Easy
103 Binary Tree Zigzag Level Order Traversal 35.5% Medium
102 Binary Tree Level Order Traversal 41.0% Medium
101 Symmetric Tree 39.5% Easy
100 Same Tree 47.0% Easy
99 Recover Binary Search Tree 30.4% Hard
98 Validate Binary Search Tree 23.8% Medium
96 Unique Binary Search Trees 41.5% Medium
95 Unique Binary Search Trees II 31.8% Medium
94 Binary Tree Inorder Traversal 47.8% Medium