Tree: Preorder Traversal

  • + 0 comments

    Python solution:

    def preOrder(root):
        def recursion(root, results):
            if root is None:    # base case: empty subtree
                return
            results.append(root.info)
            recursion(root.left, results)
            recursion(root.right, results)        
        results = []
        recursion(root, results)
        print(" ".join(map(str, results)))