00:01
In this question, there is a tree.
00:02
One is a root node, is a blank node and it has two child.
00:06
One is a and other is a blank.
00:13
After that, other blank is a, now become a root node and it has a two child.
00:19
One is blank and other is d.
00:24
Then the blank node is become a root node, has two child b and c.
00:29
So, what is the characters of c and d? it ask in this question.
00:33
So, in this case, the codes are determined by the path from the root to the specific characters.
00:45
Following the convention that the left branch is coded as 0 and the right branch as 1.
00:51
So, we can find the codes for the characters c and d.
01:02
So, after seeing this tree, we have to conclude that the code for c is obtained by following the path 1, 1, 1...