From 94646354cf1ac42e2d698e2193513164e7193aaf Mon Sep 17 00:00:00 2001
From: Yevhen Kozirovskyi <yevhen.kozirovskyi@student.tuke.sk>
Date: Sun, 19 Jan 2025 17:48:48 +0000
Subject: [PATCH] =?UTF-8?q?=D0=9E=D0=B1=D0=BD=D0=BE=D0=B2=D0=B8=D1=82?=
 =?UTF-8?q?=D1=8C=20sk1/compressor.c?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 sk1/compressor.c | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)

diff --git a/sk1/compressor.c b/sk1/compressor.c
index 7a2482f..b51b200 100644
--- a/sk1/compressor.c
+++ b/sk1/compressor.c
@@ -102,7 +102,21 @@ struct MinHeap* createAndBuildMinHeap(unsigned char data[], int freq[], int size
     buildMinHeap(minHeap);
     return minHeap;
 }
+void freeMinHeap(struct MinHeap* minHeap) {
+    for (int i = 0; i < minHeap->size; ++i) {
+        free(minHeap->array[i]);
+    }
+    free(minHeap->array);
+    free(minHeap);
+}
 
+void freeHuffmanCodes(char* codes[256]) {
+    for (int i = 0; i < 256; ++i) {
+        if (codes[i]) {
+            free(codes[i]);
+        }
+    }
+}
 // Build Huffman Tree
 struct MinHeapNode* buildHuffmanTree(unsigned char data[], int freq[], int size) {
     struct MinHeapNode *left, *right, *top;
@@ -213,6 +227,8 @@ int compressFile(const char* input_file_name, const char* output_file_name) {
     for (int i = 0; i < 256; i++) {
         if (codes[i]) free(codes[i]);
     }
+    freeHuffmanCodes(codes);  // Освободите память для кодов
+    freeMinHeap(minHeap);  // Освободите память для кучи
     return 0;
 }