Postorder Traversal

Easy

Postorder Traversal

Binary tree traversal that visits children first, then the root.

TreeRecursionTraversal

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

1/29

Visit all children first, then visit the root last.

Basics

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

Best

O(N)

Average

O(N)

Worst

O(N)

Space Complexity

O(H)

Postorder Traversal | AlgoNote