diff --git a/libmineziper/include/libmineziper_huffman_tree.h b/libmineziper/include/libmineziper_huffman_tree.h
index 7f58acb..b8437c2 100644
--- a/libmineziper/include/libmineziper_huffman_tree.h
+++ b/libmineziper/include/libmineziper_huffman_tree.h
@@ -3,6 +3,9 @@
 
 #include "libmineziper_bitstream.h"
 
+#define DEFAULT_TREE_SIZE 288
+#define DEFAULT_DIST_TREE_SIZE 32
+
 typedef struct leaf
 {
   int code;
@@ -21,5 +24,6 @@ unsigned int* sort(unsigned char* ints, int size);
 void print_huffman_tree(tree t);
 tree build_tree(char* bit_lengths, int size);
 tree build_default_tree();
+tree build_default_dist_tree();
 
 #endif
\ No newline at end of file
diff --git a/libmineziper/src/libmineziper_huffman_tree.c b/libmineziper/src/libmineziper_huffman_tree.c
index c696721..407f35c 100644
--- a/libmineziper/src/libmineziper_huffman_tree.c
+++ b/libmineziper/src/libmineziper_huffman_tree.c
@@ -44,9 +44,8 @@ tree build_tree(char* bit_lenghts, int size)
 
 tree build_default_tree()
 {
-  char bit_lengths[288];
-
-  for (int i = 0; i < 288; i++)
+  char bit_lengths[DEFAULT_TREE_SIZE];
+  for (int i = 0; i < DEFAULT_TREE_SIZE; i++)
   {
     if (i < 144 || i >= 280)
       bit_lengths[i] = 8;
@@ -58,7 +57,18 @@ tree build_default_tree()
       bit_lengths[i] = 7;
   }
 
-  return build_tree(bit_lengths, 288);
+  return build_tree(bit_lengths, DEFAULT_TREE_SIZE);
+}
+
+tree build_default_dist_tree()
+{
+  char bit_lengths[DEFAULT_DIST_TREE_SIZE];
+  for (int i = 0; i < DEFAULT_DIST_TREE_SIZE; i++)
+  {
+    bit_lengths[i] = 5;
+  }
+
+  return build_tree(bit_lengths, DEFAULT_DIST_TREE_SIZE);
 }
 
 unsigned int* sort(unsigned char* ints, int size)