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 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
// EXAMPLE FROM POST-LECTURE QUESTIONS - definitely incomplete; might have mistakes
static bool _is_leaf(TreeNode* node) {
return node -> left == NULL && node -> right == NULL;
}
int main(int argc, char* argv[]) {
uint8_t input[] = { 'A', '\0', '\0', 'C' };
TreeNode* root = create_huffman_tree(…);
assert(root -> left -> character == '\0' );
assert(root -> left -> frequency == 2 );
assert(root -> left -> left == NULL );
assert(root -> left -> right == NULL );
assert(root -> right -> frequency == 2 );
assert(root -> right -> left -> character == 'A' );
assert(root -> right -> right -> character == 'C' );
write_compressed(root, &writer, input, 4);
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2023 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.