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

Question Timeline

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

Company

Level

Region

Late July, 2025

Comments

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

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 94. Binary Tree Inorder Traversal

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact