Back to Questions

Binary Tree Inorder Traversal (Iterative)

121.9K views•Asked at Microsoft•
Medium

Question Explain

Given the root of a binary tree, return the inorder traversal of its nodes' values. Implement the solution iteratively using a stack.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Reverse a Linked List

46K views

Kth Smallest Element in a BST

94.8K views

Lowest Common Ancestor of a BST

74.7K views
Binary Tree Inorder Traversal (Iterative) - Interview Question