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.
  1. Tree: Preorder Traversal
  2. Discussions

Tree: Preorder Traversal

  • hideki_ryuga_pe1
     + 0 comments

    Ridiculously easy. Note that python optimizes tail recursive loops so this isn't an inefficient use of recursion.

    def preOrder(root):
    if root is None:
        return
    print(root.info, end=' ')
    preOrder(root.left)
    preOrder(root.right)