566 views

2 Answers

Best answer
3 votes
3 votes

also with other combinations , code for C is length 3 so ans should be option B

plz verify!!!

selected by
1 votes
1 votes

If we make the Huffman tree for following values we will get :

Caption

Related questions

0 votes
0 votes
3 answers
1
Arunav Khare asked Mar 31, 2017
505 views
If T is a binary tree with N nodes, then the number of levels is at least
0 votes
0 votes
1 answer
2
VS asked Apr 9, 2017
379 views
0 votes
0 votes
2 answers
3
VS asked Apr 9, 2017
296 views
0 votes
0 votes
2 answers
4
VS asked Apr 9, 2017
450 views