Coding Interview Question: Inorder Traversal

Question

Given a binary search tree, print out the elements of the tree in order without using recursion.

eg.

1

2

3

4

5

6

7

1

2

3

5

6

7

8

Once you think that you’ve solved the problem, click below to see the solution.

As always, remember that practicing coding interview questions is as much about how you practice as the question itself. Make sure that you give the question a solid go before skipping to the solution. Ideally if you have time, write out the solution first by hand and then only type it into your computer to verify your work once you've verified it manually. To learn more about how to practice, check out this blog post.

Solution

How was that problem? You can check out the solution in the video below.