Getting everything ready for you…

Loading courses, problems and your progress. This takes just a moment.

0s

Visualizer › Trees

Preorder Traversal

Visits the node first, then its left subtree, then its right subtree.

How it works

Complexity

Code (Python)

def preorder(node, out):
    if node:
        out.append(node.val)
        preorder(node.left, out)
        preorder(node.right, out)

Practise: Trees problems