Binary Tree Pruning (LeetCode 814) – Part 2
MediumLeetCode 814 · General Recursion on Trees · Google, Amazon +3 · 6:00Binary Tree Pruning (O(n))- (Google, Amazon, Microsoft) : Explanation + Live Coding 🧑🏻💻👩🏻💻My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution (part 2 of 2) for LeetCode 814 Binary Tree Pruning by codestorywithMIK: Trees, Medium. Topics: Tree, Depth-First Search, Binary Tree. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Tree, Depth-First Search, Binary Tree
- Patterns
- General Recursion on Trees
- Chapter
- Trees
- Duration
- 6:00
Related problems
- Time Needed to Inform All Employees (LeetCode 1376)
- Find Leaves Of Binary Tree (LeetCode 366)
- Count Complete Tree Nodes -(Amazon, Microsoft, Salesforce, Meta) : Explanation ➕ Live Coding (LeetCode 222)
- Leaf-Similar Trees (LeetCode 872)
- Maximum Product of Splitted Binary Tree (LeetCode 1339)
- Same Tree (LeetCode 100)
- Find Duplicate Subtrees (Leetcode - 652) - (GOOGLE) : Explanation ➕ Live Coding (LeetCode 652)
- Symmetric Tree (Leetcode - 101) - (Amazon, Microsoft, Mentor (Siemens)) : Explanation ➕ Live Coding (LeetCode 101)