수다닷컴

//------example07func.h
#ifndef _EXAMPLE07_FUNC_
#define _EXAMPLE07_FUNC_
typedef struct LinkedHeapElementType{
int key;
char data;
struct LinkedHeapElementType *pLeftChild;
struct LinkedHeapElementType *pRightChild;
}heapNode;
typedef struct rootLinkedHeapType{
int currentHeapNodeCount;
heapNode *pRootNode;
}linkedHeap;
linkedHeap* createLinkedMaxHeap();
int insertLinkedMaxHeapNode(linkedHeap *pLinkedHeap,heapNode element);
heapNode* deleteLinkedMaxHeapNode(linkedHeap *pLinkedHeap);
int deleteLinkedHeap(linkedHeap *pLinkedHeap);
void displayLinkedHeap(linkedHeap *pLinkedHeap);
#endif
#ifndef _COMMON_TREE_DEF_
#define _COMMON_TREE_DEF_
#define FALSE 0
#define TRUE 1
#endif
//----example07func.c
#include stdio.h
#include stdlib.h
#include example07func.h
linkedHeap* createLinkedMaxHeap(){
linkedHeap *pReturn=NULL;
pReturn=(linkedHeap*)malloc(sizeof(linkedHeap));
if(pReturn!=NULL){
pReturn-currentHeapNodeCount=0;
pReturn-pRootNode=NULL;
}
else
puts(error createLinkedMaxHeap(pReturn=NULL));
}
int insertLinkedMaxHeapNode(linkedHeap *pLinkedHeap,int key){
int ret=FALSE,current=2;
heapNode element,*pHeapNode=NULL,*pNewNode=NULL;
if(pLinkedHeap!=NULL){
if(pLinkedHeap-currentHeapNodeCount==0){
element.key=key;
element.pLeftChild=NULL,element.pRightChild=NULL;
pLinkedHeap-currentHeapNodeCount++;
pLinkedHeap-pRootNode=(heapNode*)malloc(sizeof(heapNode));
*(pLinkedHeap-pRootNode)=elemnt;
}
else{
pNewNode=(heapNode*)malloc(sizeof(heapNode));
여기까지 하다가 막혔음........

신청하기