Preorder Traversal

Easy

Preorder Traversal

Binary tree traversal that visits the root first.

TreeRecursionTraversal

Preorder traversal visits nodes in Root -> Left subtree -> Right subtree order.

1/29

Visit the root first, then the left subtree, and finally the right subtree.

Basics

Preorder traversal visits nodes in Root -> Left subtree -> Right subtree order.

Best

O(N)

Average

O(N)

Worst

O(N)

Space Complexity

O(H)

Preorder Traversal | AlgoNote