1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
#include "priority_queue.h"
Node* pq_enqueue(Node** a_head, void* a_value, int (*cmp_fn)(void const*, void const*)) {
return NULL; // STUB -- remove this line when filling in the body of pq_enqueue(…).
}
Node* pq_dequeue(Node** a_head) {
return NULL; // STUB -- remove this line when filling in the body of pq_dequeue(…).
}
Node* stack_push(Node** a_head, void* a_value) {
return NULL; // STUB -- remove this line when filling in the body of stack_push(…).
}
Node* stack_pop(Node** a_head) {
return NULL; // STUB -- remove this line when filling in the body of stack_pop(…).
}
void destroy_list(Node** a_head, void (*destroy_value_fn)(void*)) {
}
#define HUFFMAN_C_V1
|
© Copyright 2022 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.