수다닷컴

문제가
1. 이진탐색트리를 이용하여 오름차순 결과 출력
2. 이진탐색트리를 이용하여 내림차순 결과 출력
3. 히프트리를 이용하여 오름차순 결과 출력

어디가 틀렸는지.... 오류 수정좀....

#includestdio.h
typedef struct Tree node
{
int key;
struct tree node *left,*right;
}
Tree node;
typedef struct
{
int key;
}
element;
typedef struct
{
element *heap;
int heap_size;
}
Heap Type; //Tree
void insert_Node(treeNode **root, int key)
{
Tree Node *parent,*cur;
Tree Node *new_node;
cur=*root;
parnet=NULL;
while ( cur != NULL)
{
if(key==cur-key)
return;//이미존재
parent=cur;
if(keycur-key)
cur=cur-left;
else cur=cur-right;
}
new_node=(TreeNode*)malloc(sizeof(TreeNode);
if(new_node==NULL)
return;//데이터 복사
new_node-key=key;
new_node-left=new_node-right=NULL;
if(parent!=NULL)
if(keyparent-key)
parent-left=new_node;
else parent -right=new_node;
else*root=new_node;
void
*Binary_Tree_Accend(Tree Node *node)
{
if(node!=NULL)
{
Binary_Tree_Accend (node-left);
printf(%d,node-key);
Binary_Tree_Accend(node-right);
}
void Binary_Tree_Deccend(node-right);
printf(%d,node-key);
Binary_Tree_Deccend(node-left);}
}//Heap
void init(HeapType*h,int num)
{
h-heap=(element *) malloc(sizeof(element)*num);
h-heap-size=0;
}
void insert_max-heap(Heap Type*h,element item)
{
int i;
i=++(h-heap_size);
while((i!=1)&&(item.key-h-heap[i/2]].key))
{
h-heap[i]=h-heap[i/2];
]
i/=2;

}
h-heap[i]=item;
}
int delete_max_heap(Heap Type *h)
{
int parent,child,t;
element item,temp;
item=h-heap[1];
temp=h-heap[(h-heap-size)--];
parine=1;
child=2;
while (child = h - heap-size)
{
if((child h -heap_size)&&(h-heap[child]key)
h-heap[child+1]key) child ++;
if(temp.key=h-heap[child].key)break;
h-heap[parent]=h-heap[child];
parent=child;
child*2;
}
h- heap[parent]=temp;
t=item.key;
returnt;
}
void Heap_Tree_Accend (Heap Type *heap,intn)
{
int i;
for(i=(n-1); i=0;, i--)
{
printf(%d, delete_max-heap(heap));
}
}
int main()
{
input,n,i;
int *heap_arry=NULL;
int *node =NULL;
TreeNode*root=NULL;

}
HeapType heap;
element ele;
printf(입력할 노드 개수: );
scanf(%d, &input);
init(&heap,input);
heap_array=(int *)
malloc((sizeof(heap_array)*input);
printf(노드를 %d개 만큼 입력해주세요\ninput);
for(i=0; i=0; i--)
{
heap_array[i]=dellete_max_heap(&heap);}어느것이 문제입니까??

신청하기