Hey there and welcome back.
Let's now do this question which is about in-order traversal implemented in an iterative manner.
So inorder traversal means that you have to first visit the left part, then the root and then the right
part of a given node.
Right.
So again let's read the question.
Given the root of a binary tree returned the inorder traversal of its nodes values right.
The iterative solution.
So we are given an example.
If this is the binary tree given to us this is the expected output.
Notice that over here we have the values and not nodes because it's mentioned over here that return
the inorder traversal of its nodes values.
And again over here it's also mentioned that we are expected to write the iterative solution in the
next video.
Let's try to think about how we can do this.
And let's start with building the intuition required for understanding how we can approach this question.