We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
defgetQueue(root,q=[]):ifnotroot:returnifroot:q.insert(0,root.info)getQueue(root.right,q)getQueue(root.left,q)returnqdefpostOrder(root):#Write your code hereq=getQueue(root)traversal=" ".join(map(str,q))print(traversal)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Postorder Traversal
You are viewing a single comment's thread. Return to all comments →
Tail Recursion + Queue