You are viewing a single comment's thread. Return to all comments →
def postOrder(root): result = [] def traverse(node): if not node: return traverse(node.left) traverse(node.right) result.append(str(node.info)) traverse(root) print(" ".join(result))
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 →