2. void MinHeap ::: Push(const T& e) { if(heapSize == capacity) { Change1D(heap, capacity, 2*capacity); capacity *= 2; } int currentNode = ++heapSize; //데이터가 들어갈 위치 : heapSize + 1 while (currentNode !=1 && heap[currentNode/2] > e) { heap[currentNode] = heap[currentNode/2]; currentNode /= 2; } heap[currentNode] = e; } void MinHeap :: Pop() { if(IsEmpty()) throw "Heap is empty."; heap[1]. ~T(); //..