@Test
    public void increasesKey()
    {
        MyInteger[] integers = new MyInteger[30];
        for (int i = 1; i < 30; i+=2)
        {
            integers[i] = new MyInteger(i);
            treeHeap.insert(integers[i]);
        }
        integers[5].myInt = 26;
        treeHeap.valueChanged(integers[5]);
        MyInteger[] ar = new MyInteger[treeHeap.size()];
        for (int i = 0; i < treeHeap.size(); i++)
            ar[i] = new MyInteger((i*2) + 1);
        ar[2].myInt = 11;
        ar[5].myInt = 23;
        ar[11].myInt = 26;
        boolean test = true;
        for (int i = 0; i < treeHeap.size(); i++)
        {
            MyInteger m = (MyInteger)treeHeap.getArray()[i];
            if (ar[i].myInt != m.myInt)    test = false;
        }
        assertTrue(test);
    }