Home »
» Huffman's Algorithm
Unknown 1:07:00 AM
Huffman's Algorithm: Suppose w1 and w2 are two minimum weights among the n given weights w1, w2,..................,wn.Find a tree T Prime which gives a solution for the n - 1 weights
w1 + w2, w3, w4, ..........., wn
Then, in the tree T Prime , replace the external node
w
1 + w2 by the subtree
The new 2-tree T Prime is desired solution
If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :
CSE SOLVE
Related Posts:
Deleting the Node with a Given ITEM of Information
Procedure: DELETE(INFO, LINK, START, AVAIL, ITEM)
This algorithm deletes from a linked list the first node N which contains given ITEM of information.
1. [Use procedure FINDB to find the location o… Read More- Deleting the Node Following a Given Node
Algorithm: DEL(INFO, LINK, START, AVAIL, LOC, LOCP)
This algorithm deletes the node N with location LOC, LOCP is the location of the node which precedes N or , where N is the first node… Read More
- Inserting at the Beginning of a List
Algorithm: INSFIRST(INFO, LINK, START, AVAIL, ITEM)
This algorithm inserts ITEM as the first node in the list.
1. [OVERFLOW?] If AVAIL = NULL , then : Write: OVERFLOW… Read More
- Deleting the Node Following a Given Node
Algorithm: DEL(INFO, LINK, START, AVAIL, LOC, LOCP)
This algorithm deletes the node N with location LOC, LOCP is the location of the node which precedes N or , where N is the first node… Read More
- Deleting the Node with a Given ITEM of Information
Procedure: FINDB(INFO, LINK, START, ITEM, LOC, LOCP)
This procedure finds the location LOC of the first node N which contains ITEM and the location LOCP of the node preceding N. If ITEM does not appear in the… Read More
Posts
0 comments:
Post a Comment