Postorder iterator


  • 1
    P

    That would be cool to have a problem to implement an iterator over a binary tree in post order.
    Challenge is to do only required work on each getNext() call - because traversing the whole tree and playing with the result set is not very useful in practice.

    Anyone got a solution?


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.