00:01
Hello, here we are with the answers to the given question.
00:02
Let's start the discussion.
00:04
In this context, we are dealing with the checking pre -order situation, check pre -order and post -order.
00:18
So, let's have a look into the very same here.
00:21
So, first of all, you can graph the dfs algorithm and here you can take the values a to b, b to c, b to a, a to d etc.
00:37
Then you can move to the stack time diagram, stack time diagram, which would be dealing with the specifications like a1b, 1b, 1b, 1b, b1 and so on.
00:54
Then from there, you can go for the pre -order list.
01:01
So, this would be the a, b, c, d, e, f, g, c.
01:07
Then from there, you can go for the post -order list...