← Nvidia questions
CodingReported in a candidate post, Sep 2023

Iterative inorder traversal using a stack and optimise

Filed under Nvidia

Given the root of a binary tree, return its inorder traversal (left, node, right) without recursion, using an explicit stack. Then discuss how to optimise it and state the time and space complexity.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Nvidia questions

Collected from public candidate posts and coding forums. Updated Nov 2026.