00:01
We're given an ordered ridded tree and we're asked to find the order in which the vertices of this tree are visited using an in -order traversal.
00:13
The tree is the one from exercise 9 of this section, so refer to that figure for this problem.
00:21
So the in -order traversal starts with the in -order traversal of the subtree with root b.
00:28
So this is a sub -tree with root b, which has children ef and g.
00:41
E has children k l and m.
00:53
G has child n and n has children r and s, followed by the root of the tree a, followed by the in order traversal of the subtree with root c.
01:19
This is simply c, followed by the in order traversal of the sub tree with root d.
01:25
So this subtree has a root d, which has children h, i, and j, h has child o, and j has children p and q.
01:57
Now in the second step, we have first the in -order traversal of the subtree with root e.
02:08
So this is the subtree with root e, which has children k, l, and m, followed by the root b, followed by the in -order traversal of the subtree with root f, which is simply f, followed by the in -order of the sub -tree with root g.
02:33
So this sub -tree has a root g which has a child n, which has children r and s, followed by a and c, followed by the in -order traversal of the subtree with root h...