N-ary Tree Postorder Traversal - Leetcode 590 - Python

0:00 - Read the problem
0:30 - Drawing Explanation
2:01 - Coding Explanation
4:04 - Drawing Explanation
7:23 - Coding Explanation

leetcode 590

#neetcode #leetcode #python

[jonsmith]

NeetCode where were you? I missed you.

[leeroymlg]

it's not a true neetcode video if he doesn't forget to call the recursive function at the end 😂

[abhishekdhyade]

Awww man haven’t missed anyone more than you in the past week😂❤

[LasTCursE]

We definitely need this man to return today

[RRK]

Could you solve the strange printer problem pls, it's so difficult to understand 😢

[shinjoshinjo]

Just did this one yesterday! There's an alternative iterative solution where you also start with a stack with element root, poll all of its children nodes, and then pop it and add to the array. Then you repeat the same: pop the rightmost element, add it to the array, if there are children nodes, they are added to the tail end of the array and processed as well

So you basically perform a right-to-left pre-order traversal, then reverse the resulting array

[adilansari-hqge]

Where are you bro, missing your daily videos.

[tuandino]

Oh, hello neetcode, long time no see

[pranavk]

non-cs major and i had to implement this at work in java today iteratively. Extremely helpful!

[Crazy_J]

We want the simple explanation for the strange painter question which was daily question on 21st. 🙏

[Quester-xprb]

video just uploaded now as i was going through the problem . I am lucky

[venkateshnaidu]

You literally came after 7 days! There were literally 3 hard problems🫠

[varun]

Man I was lost for few days due to there was no video from him

[MP-nyep]

Thank you ! Great explanation as always!

[PreethamC-wp]

Hi, your videos has been very helpful and informative. So for yesterday's POTD can you teach us morris traversal algo

[pa-]

Can someone explain me, why reverse order ?
Can we also use popleft and achieve ?
Pls help
(Just started lc)

[Ryurn-gl]

a question. In the iterative approach, how do we make sure to pop the element from the bottom? like what he showed in the stack illustration. He popped 2 before it's predecessors.

PS: figured it out kinda, drawing was obscure.

[AK-kqmk]

The iterative solution is overcomplicated. You can just do preorder and then reverse the result.