mergeHt(t1, t2){
	if (!full(t1) && !full(t2)){

	}

	Node root = lastLeaf(t2);
	delete(root, t2);
	HeapTree tree = makeTree(root, t1, t2);
	bubbleDown(tree);
	return tree;
}