Given the following set of character - probability pairs : ( C , 0 . 1 ) , ( D , 0 . 1 ) , ( R , 0 . 2 ) , ( 5 , 0 . 3 ) , ( E , 0 . 3 ) ( 2 )...
Huffman tree and total number of unit time as asked in the given picture
Given the following set of character - probability pairs :"( C , 0 . 1 ) , ( D , 0 . 1 ) , ( R , 0 . 2 ) , ( 5 , 0 . 3 ) , ( E , 0 . 3 )( 2 ) Build a Huffman tree for this character set . Fill in the following table to show the queue L.which will start with the leaf nodes for the symbols , and the queue T, which will contain thesubtrees as they are built . Draw the tree shape for each subtree in T. Each row of the table mustshow the contents of the queues at the end of that step . ( Start by filling in the queue L contentsin the first line . ) The last step should have a single tree ( final Huffman tree ) in the queue T.( Ties in probability values are broken arbitrarily , and it doesn't matter which dequeued node goesleft and which goes right when building a subtree. )StepQueue [Queue I
Show more
