Reviewed-on: #13
Co-authored-by: hitanshu310 <hitanshu98@gmail.com>
Co-committed-by: hitanshu310 <hitanshu98@gmail.com>

@@ -37,1 +31,3 @@
-        return element;
+        E currentValue = start.data;
+        start = start.next;
+        return currentValue;

@@ -15,3 +17,3 @@
     }
 
-    // Will return true if size is 0
+    Node<E> head = null;

@@ -23,2 +19,2 @@
-        mergesort(arr, aux, mid+1, hi);
-        merge(arr, aux, lo, mid, hi);
+            // Copy array
+            E[] auxArr = (E[]) new Object[high_index - low_index + 1];

@@ -94,0 +51,4 @@
+        queueArray = (E[]) new Object[targetSize];
+        int j = 0;
+        for(int i=startPtr; i<endPtr; i++)
+            queueArray[j++]=tempArray[i];

@@ -103,0 +74,4 @@
+
+        @Override
+        public E next() {
+            return queueArray[iteratorIndex++];