#include <stdio.h> #include <stdlib.h> #define N 12 struct value{int data;}; struct node{struct value data;struct node *next;}; struct queue{struct node *head;struct node *anchor;int capa;int fac;}; struct node *access(struct queue *q, int number); void add_node(struct node **p, int value); int velue_node(struct queue *q, int number); void swap(struct queue *q, int a, int b); void downheap(struct node *data, int v, int num); int heap_sort(struct node *data, int num);
int main(){ struct node *head=NULL; struct node **p=&head; int data[] = {9, 8, 1, 20 ,13, 3, 4, 24, 0, 17, 4}; int i, *pnum = data; for(i=0; i<N; i++) printf("%c ", pnum[i]+'a'); printf("\n"); return data[i]==NULL?0:-1; }
.