Construct Binary Tree from Preorder and Postorder Traversal (LeetCode 889)
MediumLeetCode 889 · Traversals (DFS / BFS) · Google, Amazon +4 · 39:51Construct Binary Tree from Preorder and Postorder Traversal · Leetcode 889My 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 for LeetCode 889 Construct Binary Tree from Preorder and Postorder Traversal by codestorywithMIK: Trees, Medium. Topics: Array, Hash Table, Divide and Conquer, Tree. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Array, Hash Table, Divide and Conquer, Tree, Binary Tree
- Patterns
- Traversals (DFS / BFS), Construction & Serialization
- Chapter
- Trees
- Duration
- 39:51
Related problems
- Construct Quad Tree (Leetcode - 427) - (Google) : Explanation ➕ Live Coding (LeetCode 427)
- Time Needed to Inform All Employees (LeetCode 1376)
- Binary Tree Right Side View (LeetCode 199)
- Construct Binary Tree From Preorder And Inorder Traversal (LeetCode 105)
- Check Completeness of a Binary Tree (BFS) - (Meta, Amazon) : Explanation ➕ Live Coding (LeetCode 958)
- Binary Tree Preorder Traversal - (Microsoft, Walmart, Flipkart, Amazon) : Explanation ➕ Live Coding
- Construct Binary Tree from Inorder and Postorder Traversal (LeetCode 106)
- Longest ZigZag Path in a Binary Tree - (LeetCode 1372)