public void insert(Node newNode)
	{
		if(items == 0)
		{
			root = newNode;
			items++;
		}else
		{
			if(root.frequency > newNode.frequency)
			{
				root.prev = newNode;
				newNode.next = root;
				root = newNode;
				root.prev = null;
			}else
			{
				Node temp = root;
				while( temp.next != null && temp.next.frequency < newNode.frequency)
				{
					temp = temp.next;
				}
				if( temp.next == null)
				{
					temp.next = newNode;
					newNode.prev = temp;
				}else
				{
					temp.next.prev = newNode;
					newNode.next = temp.next;
					newNode.prev = temp;
					temp.next = newNode;
				}
			}
			items++;
		}
	}