Inorder Traversal

Easy

Inorder Traversal

Binary tree traversal that visits left subtree, root, then right subtree.

TreeRecursionTraversal

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

1/29

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

Basics

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

Best

O(N)

Average

O(N)

Worst

O(N)

Space Complexity

O(H)

Inorder Traversal | AlgoNote