중간 삽입 heap #pragma once#include #include class C_HEAP{public: struct S_NODE { int nIndex; int nData; };private: std::vector m_vBuffer; bool (*m_pCompare)(S_NODE*&, S_NODE*&);private: static bool force(S_NODE*& pDst, S_NODE*& pSrc); void addNode(S_NODE* pNode); void swap(int nDst, int nSrc); void moveUp(int nDst, bool (*pFunc)(S_NODE*&, S_NODE*&)); void moveDown(int nDst, bool (*pFunc)(S_NODE*..
