[Java] Leetcode 145. Binary Tree Postorder Traversal (Iteratively & Recursively) [Binary Tree #3]

Показать описание

In this video, I'm going to show you how to solve Leetcode 145. Binary Tree Postorder Traversal (Iteratively & Recursively) which is related to Binary Tree.

Here’s a quick rundown of what you’re about to learn:

⭐️ Course Contents ⭐️
⌨️ (0:00) Recursive Solution
⌨️ (4:09) Iterative (Similar to Preorder traversal)
⌨️ (8:40) Iterative (Remove Tree connections)
⌨️ (12:45) Iterative (Using two pointers)

In the end, you’ll have a really good understanding on how to solve Leetcode 145. Binary Tree Postorder Traversal (Iteratively & Recursively) and questions that are similar to this Binary Tree.

Рекомендации по теме

Комментарии

Thanks for the 2nd and 3rd approach and not just taking the lazy way out of reversing the answer.

oooo-rcyf

Thanks again Eric! I came up with another alternative that uses the stack. Only push the left elements in the stack and add the right element to the result list/queue.
```
result = collections.deque()
stack = []

while stack or root:
while root:
result.appendleft(root.val)
stack.append(root.left)
root = root.right

root = stack.pop()

return result
```

jeroenvandenheuvel

Thanks for sharing, great videos!

Just a quick question (16:00): we may not need "cur = null" in line 35, since we fall into the outer "else" branch when "cur == null", and we never change the cur inside this branch (in other words, cur is always equal to null in this branch) ?

pengx

Nice explanation! BTW, what is the extension you are using for drawing? Pretty cool.

jinpenglv

In line 25 why we are mentioning in 0th index we are adding top.val? What if we do like res.add(top.val) ?

amitbhattacharya

[Java] Leetcode 145. Binary Tree Postorder Traversal (Iteratively & Recursively) [Binary Tree #3]

145. Binary Tree Postorder Traversal - Java Solution

[Java] Leetcode 145. Binary Tree Postorder Traversal (Iteratively & Recursively) [Binary Tree #3...

LeetCode 145. Binary Tree Postorder Traversal RECURSIVELY - Interview Prep Ep 68

145. Binary Tree Postorder Traversal | Java | Leetcode | Binary Tree | DSA

Leetcode | 145. Binary Tree Postorder Traversal | Easy | Java Solution

LeetCode 145 | Binary Tree Postorder Traversal | Stack, LinkedList | Java

Binary Tree Postorder Traversal (Iterative) - Leetcode 145 - Python

LeetCode - 145. Binary Tree Postorder Traversal | Java

LeetCode 144 Binary Tree Preorder Traversal And 145 Binary Tree Postorder Traversal

LeetCode 145. Binary Tree Postorder Traversal in Java (Iterative Solution)

LeetCode 145 : Binary Tree Postorder Traversal || EASY || C++ || JAVA || Detailed Solution

[SOLVED!] Binary Tree Postorder Traversal - LeetCode 145 - Java

Leetcode 145 Binary Tree PostOrder Traversal. Easy Java Solution.

Facebook Interview question LeetCode 145 Binary Tree Postorder Traversal explained in JAVA

145. Binary Tree Postorder Traversal | Leetcode Medium

LeetCode 145 | Binary Tree Postorder Traversal | Java Full Solution with Conceptual Walkthrough

Leetcode #48 | Решение 145 Binary Tree Postorder Traversal

Binary Tree Post Order Traversal | Iterative Algorithm | LeetCode 145

145. Binary Tree Postorder Traversal | Postorder Traversal | Leetcode 145 | Posterorder traversal

Собеседование в IT | LeetCode | 145. Binary Tree Postorder Traversal

Binary Tree Postorder Traversal | Leetcode 145 | Java Code | Developer Coder 🌳💻

145. Binary Tree Postorder Traversal | Leetcode | Tree | The Advent

145. Binary Tree Postorder Traversal | Leetcode Daily Challenge Question | Binary Tree | Java

145. Binary Tree Postorder Traversal || Java || Leetcode || Hindi