Add heapify method

Author: AhmedLSayed9

data_structures/non_linear/trees/heaps/max_binary_heap.dart

@@ -5,6 +5,18 @@ import '../../../../utils/list_extension.dart';
 class MaxBinaryHeap {
   final List<num> _heap = [];
 
+  /// (Converting an array into a MaxBinaryHeap)
+  /// Pseudocode:
+  /// Create a new heap.
+  /// Iterate over the array and invoke your insert function.
+  /// return the values property on the heap.
+  List<num> heapify(List<num> array) {
+    for (final num in array) {
+      insert(num);
+    }
+    return _heap;
+  }
+
   /// Pseudocode:
   /// - Push the value into the values property on the heap.
   /// - Sift-Up:
@@ -81,7 +93,7 @@ void main() {
       //        41
       //   39        33
       // 18  27   12
-      heap._heap.addAll([41, 39, 33, 18, 27, 12]);
+      heap.heapify([41, 39, 33, 18, 27, 12]);
 
       //             55
       //        39        41
@@ -103,7 +115,7 @@ void main() {
       //        41
       //   39        33
       // 18  27   12
-      heap._heap.addAll([41, 39, 33, 18, 27, 12]);
+      heap.heapify([41, 39, 33, 18, 27, 12]);
 
       //        39
       //   27        33
@@ -118,4 +130,14 @@ void main() {
       expect(heap.extract(), isNull);
     });
   });
+
+  group('heapify', () {
+    test('should convert the list into MaxBinaryHeap', () {
+      final heap = MaxBinaryHeap();
+      //         6
+      //     5      3
+      //   1   2
+      expect(heap.heapify([2, 3, 6, 1, 5]), [6, 5, 3, 1, 2]);
+    });
+  });
 }

data_structures/non_linear/trees/heaps/min_binary_heap.dart

@@ -5,6 +5,18 @@ import '../../../../utils/list_extension.dart';
 class MinBinaryHeap {
   final List<num> _heap = [];
 
+  /// (Converting an array into a MinBinaryHeap)
+  /// Pseudocode:
+  /// Create a new heap.
+  /// Iterate over the array and invoke your insert function.
+  /// return the values property on the heap.
+  List<num> heapify(List<num> array) {
+    for (final num in array) {
+      insert(num);
+    }
+    return _heap;
+  }
+
   /// Pseudocode:
   /// - Push the value into the values property on the heap.
   /// - Sift-Up:
@@ -81,7 +93,7 @@ void main() {
       //        6
       //   12        15
       // 18  16   20
-      heap._heap.addAll([6, 12, 15, 18, 16, 20]);
+      heap.heapify([6, 12, 15, 18, 16, 20]);
 
       //            3
       //       4         6
@@ -103,7 +115,7 @@ void main() {
       //        6
       //   12        15
       // 18  16   20
-      heap._heap.addAll([6, 12, 15, 18, 16, 20]);
+      heap.heapify([6, 12, 15, 18, 16, 20]);
 
       //        12
       //   16        15
@@ -118,4 +130,14 @@ void main() {
       expect(heap.extract(), isNull);
     });
   });
+
+  group('heapify', () {
+    test('should convert the list into MinBinaryHeap', () {
+      final heap = MinBinaryHeap();
+      //         1
+      //     2      5
+      //   6   3
+      expect(heap.heapify([6, 5, 3, 1, 2]), [1, 2, 5, 6, 3]);
+    });
+  });
 }