retagged by
330 views

1 Answer

0 votes
0 votes
In Huffman coding, we start with elements with lower frequency and then add them up successively. So, the value of root is always greater than the value of its children. This property cannot be satisfied by a min heap. As in min heap, value of root is always less than the value of its children.

Hence, answer should be A, binary min heap.

Related questions

0 votes
0 votes
1 answer
2
Shraddha dwevedi asked Nov 24, 2021
329 views
Q.which of the following data structure cannot be used for efficient implementation of Priority Queue?a. Binary heapb. Height balanced binary tree.c. Sorted array
1 votes
1 votes
1 answer
3
Hira Thakur asked Aug 14, 2016
475 views
suppose a problem A reduces to problem B & reduction is done at $O(n^2)$ time.if the problem is solved in $O(n^3)$ time then what about the time of problem A___??$O(n^2)$...