Binary Tree Inorder Traversal (LeetCode 94): Interview Notes
View and share code snippets on Pastefy.
# Binary Tree Inorder Traversal (LeetCode 94): Interview Notes
## Problem
Given the root of a binary tree, return the inorder traversal of its nodes' values.
## Approach
Recursive: left → visit → right. Iterative: explicit stack — go left while possible, then pop/visit, then go right. Mention Morris traversal only as a follow-up for O(1) extra space.
## Complexity
Time O(n). Space O(h) recursive/stack, or O(1) Morris.
## Practice tip
Practice tree DFS aloud with [https://www.linkjob.ai/](https://www.linkjob.ai/).
*Disclosure: I work on Linkjob AI.*