00:01
All right, so here for the list, the symbols and the frequencies, we have our symbol a, and then we have the frequency of 0 .20, b, 0 .10, c, 0 .15.
00:16
D is 0 .25, and e is 0 .30.
00:22
So then we combine b, 0 .1010 and c into node 1, which is 0 .25, combine a, 0 .30 ,000, and c, and c, c, then we combine a, 0.
00:30
0 .20 and node 1 to get node 2, which is 0 .45, and then d, 0 .25, and e, 0 .30.
00:40
So that's going to be node 3, which is 0 .55, and then combine node 2 and node 3 to get the root of 1 .0.
00:48
So then we assign binary codes.
00:50
We start from the root.
00:51
We assign 0 to the left branch, 1 to the right, and then continue recursively.
00:56
And the resulting codes here, let's say, might be, let's say e be 1 -1, it's going to be 0 .30, d be 1 -0 .25...