00:02
We're given an ordered rooted tree, and we're asked to determine the order in which the vertices of the tree are visited using a post -order traversal.
00:14
So the tree is the one in exercise 8 of this section.
00:19
So i refer to that figure for this problem.
00:23
So in the first step, we have the post -order traversal of the sub -tree with root b.
00:31
So this subtree has root b, which has children.
00:35
D and e, and e has children i and j, and j has children m, n, and o, followed by the post -order traversal of the subtree with root c, so this sub -tree has a root c, which has children f, g, and h, and h has children k and l, and l has child p, followed by the root of this tree, which is a.
01:39
In the next step, we have the post -order traversal of the sub -tree with root d, which is simply d, followed by the post -order traversal of the sub -tree with root e.
01:55
So this sub -tree has a root e in children, i and j, and j.
02:06
And j has children, m, n, and o, followed by the root b, followed by the post -order traversal...