// TODO: modify it so it doesn't always insert into left,
// but traverses up when size is a certain value
// and swaps the values when one is bigger than it's parent
bool insert(int value)
{
	static heapNode * last = NULL;
	// make a new heapNode and set the value
	heapNode *newNode = new heapNode(value);

	// you can make it so the heap constructor sets root to last
	if(last == NULL)
		last = root;

	// check left child
	if(last->getLeft() == NULL)
	{
		// check here to see if parent is bigger than child, if so swap
		last->setLeft(newNode);
	}
	// check right child
	else if(last->getRight() == NULL)
	{
		// check here to see if parent is bigger than child, if so swap
		last->setRight(newNode);
	}
	// both children are filled, so either traverse/percolate up or make one of the children your new last
	// depending on how well balanced the heap is
	else
		;

	// TODO: set last to the last node or parent


	// increment size
	size++;
	return true;
}