Build Huffman Tree with Priority Queue in C

Hi,

I am working on the Huffman Algorithm in C for my class project.  I am having trouble building the huffman tree to start.  This is what I have so far:

TreeNode * buildHuffmanTree(int freqs[256])
{
int i;
PriorityQueue forest;
TreeNode* leftP, *rightP, *tmp;
TreeEntry* top;

CreatePQueue(&forest);

/* YOU FILL IN THE REST OF THIS CODE */
for (i = 0; i < 256; i++)
{
if (freqs[i] > 0)
{
leftP = malloc (sizeof(TreeNode));
leftP->left = NULL;
leftP->right = NULL;
pqInsert(leftP, &forest);
}
}

while (freqs[i] > 1)
{

leftP = deleteMin(&forest);
rightP = deleteMin(&forest);
tmp->left = leftP;
tmp->right = rightP;
tmp = MakeNode(top->symbol, top->weight, tmp->left, tmp->right);
pqInsert(tmp, &forest);
}
return tmp;
{

If anyone has any advice I would appreciate it.  Thanks.
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

Commented:
0
Author Commented:
I am familiar with all those web pages, and it doesn't really help me with implementing the actual code to create a tree using a priority queue.
0
Commented:
are you able to implement deleteMin and pqInsert?
0
Commented:
0
Commented:
What is then your troubles? If you know algorithm very well then try to write pseudo code and then convert it to C
Here is one sample
http://www.codeproject.com/cpp/Huffman_coding.asp
0
Author Commented:
ozo - I am able to implement deleteMin and pqInsert and  I have in the following code.  AlexNek, converting it to C is where I am having the problem.  I had posted the code I had written in hopes of getting criticism on what I may be doing wrong.

TreeNode * buildHuffmanTree(int freqs[256])
{
int i;
PriorityQueue forest;
TreeNode* leftP, *rightP, *tmp;
TreeEntry* top;

CreatePQueue(&forest);

/* YOU FILL IN THE REST OF THIS CODE */
for (i = 0; i < 256; i++)
{
if (freqs[i] > 0)
{
leftP = malloc (sizeof(TreeNode));
leftP->left = NULL;
leftP->right = NULL;
top->weight = freqs[i];
top->symbol = (char) i;
leftP = MakeNode(top->symbol, top->weight, leftP->left, leftP->right);
pqInsert(leftP, &forest);
}
}

while (tmp->left&&tmp->right != NULL)
{

leftP = deleteMin(&forest);
rightP = deleteMin(&forest);
tmp->left = leftP;
tmp->right = rightP;
tmp = MakeNode(top->symbol, top->weight, tmp->left, tmp->right);
pqInsert(tmp, &forest);
}
return tmp;
{
0
Commented:
>converting it to C is where I am having the problem.
It can't be a big problem. Post the pseudo code and notice the parts with troubles.

>...in hopes of getting criticism
This lines look not so good for me.
tmp->left = leftP;
tmp->right = rightP;

tmp = MakeNode(top->symbol, top->weight, tmp->left, tmp->right);
You assign unassigned variable /at least I can't see where it was/, fill the fields and then assign variable.

I have a small notices in addition. I don't like:
- function parameters like int freqs[256
- variables declaration in one line TreeNode* leftP, *rightP, *tmp;
- such a logical expression while (tmp->left&&...
0

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Commented:
top->weight and top->symbol also seem to be referencing an undefined pointer
what is MakeNode, and how  are TreeNode and TreeEntry defined?
0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
C

From novice to tech pro — start learning today.

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.