Coach note

Coding questions test whether you can carry a problem from a vague spec to a working solution while talking through your decisions. Interviewers watch the process at least as much as the answer.

Coding · Data Structures

Implement a function that takes the root of a binary search tree and returns an iterator that yields values in order. The iterator should use O(h) space.

Type your answer

0of ~200 wordsAbout a minute spoken

Voice isn’t supported in this browser — type your answer in the box.

Create a free account to get more critiques.

Your answer

Your answer appears here as you speak.

Implement a function that takes the root of a binary search tree and returns an iterator that yields values in order. The iterator should use O(h) space.

Practice more