#ifndef PRIORITYQUEUE_H
#define QEIORITYQUEUE_H

#include<stdio.h>
#include<stdlib.h>
#include<memory.h>

typedef int PriorityType;

typedef struct tagPQNode
{
 PriorityType Priority;
 void* Data;
} PQNode;

typedef struct tagPriorityQueue
{
 PQNode* Nodes;
 int Capacity;
 int UsedSize;
} PriorityQueue;

PriorityQueue* PQ_Create( int InitialSize );
void PQ_Destroy( PriorityQueue* PQ );
void PQ_InQueue( PriorityQueue* PQ, PQNode NewData );
void PQ_DeQueue( PriorityQueue* PQ, PQNode* Root );
int PQ_GetParent( int Index );
int PQ_GetLeftChild( int Index );
void PQ_SwapNodes( PriorityQueue* PQ, int Index1, int Index2 );
void PQ_IsEmpty( PriorityQueue* PQ );

#endif

-----------------------------------------------------------------------

#include"PriorityQueue.h"

PriorityQueue* PQ_Create( int InitialSize )
{
 PriorityQueue* PQ = (PriorityQueue*)malloc( sizeof(PriorityQueue*) );

 PQ->Capacity = InitialSize;
 PQ->UsedSize = 0;
 
 PQ->Nodes = (PQNode*)malloc( sizeof(PQNode) * PQ->Capacity );

 return PQ;
}

void PQ_Destroy( PriorityQueue* PQ )
{
 free( PQ->Nodes );
 free( PQ );
}

void PQ_InQueue( PriorityQueue* PQ, PQNode NewData )
{
 int CurrentPosition = PQ->UsedSize;
 int ParentPosition  = PQ_GetParent( PQ->UsedSize );

 if( PQ->UsedSize == PQ->Capacity )
 {
  if( PQ->Capacity == 0 )
   PQ->Capacity = 1;

  PQ->Capacity *= 2;
  
  PQ->Nodes = (PQNode*)realloc( PQ->Nodes, sizeof(PQNode) * PQ->Capacity );
 }

 PQ->Nodes[CurrentPosition] = NewData;

 while( CurrentPosition > 0 && PQ->Nodes[CurrentPosition].Priority < PQ->Nodes[ParentPosition].Priority )
 {
  PQ_SwapNodes( PQ, CurrentPosition, ParentPosition );

  CurrentPosition = ParentPosition;
  ParentPosition  = PQ_GetParent( CurrentPosition );
 }

 PQ->UsedSize++;
}

void PQ_DeQueue( PriorityQueue* PQ, PQNode* Root )
{
 int ParentPosition = 0;
 int LeftPosition   = 0;
 int RightPosition  = 0;

 memcpy( Root, &PQ->Nodes[0], sizeof(PQNode) );
 memset( &PQ->Nodes[0], 0, sizeof(PQNode) );

 PQ->UsedSize--;

 LeftPosition  = PQ_GetLeftChild( ParentPosition );
 RightPosition = LeftPosition + 1;

 while( 1 )
 {
  int SelectChild = 0;

  if( LeftPosition >= PQ->UsedSize )
   break;

  if( RightPosition >= PQ->UsedSize )
   SelectChild = LeftPosition;
  else
  {
   if( PQ->Nodes[LeftPosition].Priority > PQ->Nodes[RightPosition].Priority )
    SelectChild = RightPosition;
   else
    SelectChild = LeftPosition;
  }

  if( PQ->Nodes[ParentPosition].Priority > PQ->Nodes[SelectChild].Priority )
  {
   PQ_SwapNodes( PQ, ParentPosition, SelectChild );
   SelectChild = ParentPosition;
  }
  else
   break;

  LeftPosition  = PQ_GetLeftChild( ParentPosition );
  RightPosition = LeftPosition + 1;
 }

 if( PQ->UsedSize < ( PQ->Capacity / 2 ) )
 {
  PQ->Capacity /= 2;
  
  PQ->Nodes = (PQNode*)realloc( PQ->Nodes, sizeof(PQNode) * PQ->Capacity );
 }
}

int PQ_GetParent( int Index )
{
 return ( ( Index - 1 ) / 2 );
}

int PQ_GetLeftChild( int Index )
{
 return ( ( Index * 2 ) + 1 );
}

void PQ_SwapNodes( PriorityQueue* PQ, int Index1, int Index2 )
{
 int CopySize = sizeof(PQNode);
 PQNode* Temp = (PQNode*)malloc(CopySize);

 memcpy( Temp,               &PQ->Nodes[Index1], CopySize );
 memcpy( &PQ->Nodes[Index1], &PQ->Nodes[Index2], CopySize );
 memcpy( &PQ->Nodes[Index2], Temp,               CopySize );

 free(Temp);
}

void PQ_IsEmpty( PriorityQueue* PQ )
{
 return ( PQ->UsedSize == 0 );
}

-------------------------------------------------------------------------------


#include"PriorityQueue.h"

void PrintNode( PQNode* Node )
{
 printf("작업명 : %s (우선순위:%d)\\n", Node->Data, Node->Priority);
}

int main(void)
{
 PriorityQueue* PQ = PQ_Create( 3 );
 PQNode Popped;

 PQNode Nodes[7] =
 {
  (34, (void*)"코딩"),
  (12, (void*)"고객미팅"),
  (87, (void*)"커피타기"),
  (45, (void*)"문서작성"),
  (35, (void*)"디버깅"),
  (66, (void*)"이닦기"),
 };

 PQ_EnQueue( PQ, Nodes[0] );
 PQ_EnQueue( PQ, Nodes[1] );
 PQ_EnQueue( PQ, Nodes[2] );
 PQ_EnQueue( PQ, Nodes[3] );
 PQ_EnQueue( PQ, Nodes[4] );
 PQ_EnQueue( PQ, Nodes[5] );

 printf( "큐에 남아 있는 작업의 수 : %d\\n", PQ->UsedSize );

 while( !PQ_IsEmpty( PQ ) )
 {
  PQ_DeQueue( PQ, &Popped );
  PrintfNode( &Popped );
 }

 return 0;
}


요약을 하자면

마지막

while( !PQ_IsEmpty( PQ ) )
 {
  PQ_DeQueue( PQ, &Popped );
  PrintfNode( &Popped );
}

에서 에러가 나네요 에러 내용을 보자면

오류 5 error C2171: \'!\' : \'void\' 형식의 피연산자에는 맞지 않습니다. 
오류 6 error C2180: 제어 식의 형식이 \'void\'입니다. 

이정도인데요 Data형을 (void*) 했는거랑 관계 있을까요