Search
⌘K

Leetcode 94. Binary Tree Inorder Traversal

Return the node values of a binary tree in inorder (left → root → right) sequence. The recursive solution is trivial; the follow-up asks for an iterative approach using an explicit stack to simulate recursion.

Asked at:

Oracle

Meta


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Late July, 2025

Meta

Senior

Return Inorder traversal of a binary tree

Late April, 2025

Oracle

Staff

Comments

Your account is free and you can post anonymously if you choose.