Merge K sorted Arrays using Python

#Create a node to save in the minHeap being created class HeapNode(object): def __init__(self): self.array = 0 self.data = 0 self.index = -1 #min Heap implementation class BinHeap: def __init__(self): self.heapList = [0] self.currentSize = 0 def isEmpty(self): return self.currentSize == 0 def percUp(self, i): while i // 2 > 0: if self.heapList[i].data < self.heapList[i … More Merge K sorted Arrays using Python