Register

#made easy workbook questions

• retagged by
591 views

1 Answer

0 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.
Voting & Accepting an answer helps improve the community
← Previous · Computer Networks Bo...Next → · Made easy workbook q...
← Previous in category · Self doubtsNext in category → · IIT KGP 2022
Position:
Show:

Related questions

2 2 votes
1 1 answer
539
539 views
Hira Thakur asked Aug 14, 2016
539 views
#made easy
cosider following set of frequeciesmessage frequenciesa ...
1 1 vote
0 0 answers
438
438 views
srishtipandey420 asked Jul 4, 2024
438 views
made easy practice
the answer to the question is given as option c but when I am solving, it is coming as option a. Is the answer wrong? Am I solving incorrectly? Please confirmThe characte...
1 1 vote
1 1 answer
1.0k
1.0k views
Hira Thakur asked Aug 14, 2016
1,044 views
#made easy
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)$...
0 0 votes
1 1 answer
613
613 views
Shraddha dwevedi asked Nov 24, 2021
613 views
Made easy workbook question
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