diff --git a/trees/heaps/max_heap/max_heap.h b/trees/heaps/max_heap/max_heap.h
index cf76a15..022dfbe 100644
--- a/trees/heaps/max_heap/max_heap.h
+++ b/trees/heaps/max_heap/max_heap.h
@@ -66,8 +66,6 @@ static inline max_heap_t* initialize_max_heap_node_store(void *data);
 int initialize_max_heap_recursive_implementation(void **array, size_t index_start, size_t index_end, heap_node_t *root);
 /* This helper function is used to recursively fill a sorted array into a new heap. */
 max_heap_t* initialize_max_heap_recursive(void **array, size_t index_start, size_t index_end, max_heap_t *heap);
-/* This function creates a heap for a sorted array. */
-max_heap_t* initialize_max_heap(void **array, int length);
 /* This function combines two heaps into one - keeps the orignal ones. */
 max_heap_t* merge_max_heaps(max_heap_t *first_heap, max_heap_t *second_heap);
 /* This function combines two heaps into one - destroys the orignal ones. */