huanzhewu / data-structure Goto Github PK

[](

这里没有delete构造函数中相应new在堆上分配的内存

AVLTree<int> a;
	a.insert(3);
	a.insert(1);
	a.insert(5);
	a.insert(4);
	a.insert(2);
	a.InOrder();
	cout << endl;
	a.remove(3);
	a.remove(1);
	a.InOrder();

这样的话输出结果是错的

这里没有delete构造函数中相应new在堆上分配的内存

并没有delete与构造器中的new对应，析构函数泄露内存

Line 120:

filterDown(index,size--);

got some error when I run it. And I think it should be

size--;
filterDown(index,size-1);

The size of Heap should be adjusted first, then keep the Max Heap using filterDown.