N-ARY TREE POSTORDER TRAVERSAL | LEETCODE 590 | PYTHON ITERATIVE SOLUTION

[@AnandKumar-kz3ls]

great solution we are visiting each node only 2 time when we are moving down and up so TC will remain O(N)

[@lakeesiv123]

can you not do bfs, then reverse it?

[@charlesraj9569]

Incorrect problem# in the title

[@crackfaang]

Fixed, thanks for the heads up