santensuru / adaptive-huffman Goto Github PK

void delete_tree(node **tree) {
	if ((*tree)->left != NULL) {
		delete_tree(&(*tree)->left);
	}

	if ((*tree)->right != NULL) {
		delete_tree(&(*tree)->right);
	}
      
       // At this point,  (*tree)->left = NULL && (*tree)->right == NULL.  Right?
	if ((*tree) != NULL) {
		if ((*tree)->parent != NULL && (*tree)->left == NULL) {
			(*tree)->parent->left = NULL;
			free(*tree);
		}
		else if ((*tree)->parent != NULL && (*tree)->right == NULL) {
                        //  no chance enter here

			(*tree)->parent->right = NULL;
			free(*tree);
		}
		else if ((*tree)->right == NULL && (*tree)->left == NULL) {
			free(*tree);
			(*tree) = NULL;
		}
	}

	return;
}

I think that (*tree)->parent->right = NULL; has no chance to execute.
I wonder if you can explain it to me. Thank you!

Why is the extension of encoded file .ah?

Hello, i have an issue compiling the program.
When a write "gcc vitter.cpp input.txt" in the widows terminal, it doesn't work and it says.
"warning: input.txt: linker input file unused because linking not done"
Can you please help me ?

diff --git a/vitter.cpp b/vitter.cpp
index e14f700..1bcab25 100644
--- a/vitter.cpp
+++ b/vitter.cpp
@@ -355,7 +355,7 @@ namespace vitter {
*/

    void get_the_code(node **tree, unsigned char symbol, char *do_code, std::queue<char> *code_write) {

•           char temp[strlen(do_code)+1];
  

•           char temp[strlen(do_code)+2];
            if ((*tree)->symbol == symbol && (*tree)->left == NULL && (*tree)->right == NULL && (*tree)->weight != 0) {
                    for (int i=0; i<strlen(do_code); i++) {
                            (*code_write).push(do_code[i]);
  

@@ -378,7 +378,7 @@ namespace vitter {
}

    void get_nyt_code(node **tree, char *do_code, std::queue<char> *code_write) {

•           char temp[strlen(do_code)+1];
  

•           char temp[strlen(do_code)+2];
            if ((*tree)->weight == 0 && (*tree)->left == NULL && (*tree)->right == NULL) {
                    for (int i=0; i<strlen(do_code); i++) {
                            (*code_write).push(do_code[i]);