Help with creating a Huffman Tree.

[jadaith]

Can someone please help me with my implementation of a Huffman tree. I feel as though I'm going about this in the wrong way but I truly don't know where nor where start. I've been searching for a answer for awhile but I am not finding anything that helps. Here is my code.

// tree.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
#include <string>
#include<vector>
#include <queue>
using namespace std;

struct node
{
	char symbol;
	int freq;
	node *left,*right;
	node *next;  
	node *root;
};

int _tmain(int argc, _TCHAR* argv[])
{
	node *root;
    node *curr;
	
    root = new node;
    root->next = NULL;
	root->freq = count;
	root->left=NULL;
	root->right=NULL;

    curr = root;

	priority_queue<int>sortqueue;

	string foo = "Hello World";
	char *p = new char [foo.length()];
	memcpy(p,foo.c_str(), foo.length());


	for(int i = 0; i < foo.length(); i++)
	{
		char temp = p[i];
		int count = 1;

		for(int j=0; j<i; j++ )

			{
				if(p[i] == p[j])
				{
					i++;
				}
			}

		temp = p[i];


	for(int h=i+1; h<foo.length(); h++ )

		{
			if(p[i] == p[h])
			{
				count++;
			}
		}

	sortqueue.push(count);

	cout << temp;
	cout << count<<endl;

	
	/*cout << sortqueue.top() <<endl;
		sortqueue.pop();*/


	//node *q;
	//q->symbol=temp;
	//q->freq=count;
	//q->left=NULL;
	//q->right = NULL;
	//q->next = NULL;




	
	}
	return 0;
}