1
00:00:00,430 --> 00:00:02,260
Hey there and welcome back.

2
00:00:02,500 --> 00:00:09,310
Let's now do this question which is about in-order traversal implemented in an iterative manner.

3
00:00:09,310 --> 00:00:16,240
So inorder traversal means that you have to first visit the left part, then the root and then the right

4
00:00:16,240 --> 00:00:17,920
part of a given node.

5
00:00:17,920 --> 00:00:18,310
Right.

6
00:00:18,310 --> 00:00:20,440
So again let's read the question.

7
00:00:20,440 --> 00:00:27,190
Given the root of a binary tree returned the inorder traversal of its nodes values right.

8
00:00:27,190 --> 00:00:28,630
The iterative solution.

9
00:00:28,630 --> 00:00:30,370
So we are given an example.

10
00:00:30,370 --> 00:00:34,570
If this is the binary tree given to us this is the expected output.

11
00:00:34,570 --> 00:00:40,660
Notice that over here we have the values and not nodes because it's mentioned over here that return

12
00:00:40,660 --> 00:00:43,990
the inorder traversal of its nodes values.

13
00:00:44,080 --> 00:00:49,390
And again over here it's also mentioned that we are expected to write the iterative solution in the

14
00:00:49,390 --> 00:00:50,200
next video.

15
00:00:50,200 --> 00:00:52,720
Let's try to think about how we can do this.

16
00:00:52,720 --> 00:00:58,450
And let's start with building the intuition required for understanding how we can approach this question.