List of iterators - discussion

List of iterators - discussion

 [[1,2][3,4,5][6,7]] -> non decreasing order 
   ^    ^      ^ 
 Iterator{
   bool HasNext()
   T Next()
 }
 
  while(itr.hasNext()){
     itr.next(); 
    
  }

for(int i : list){       
 
}

// if lists are not sorted , put everything into a BST ...  
// k is the number of iterators
// avg list is of size m 
// km elements  
//if lists are not sorted then heap size must be km,,, 

If all lists are sorted, and then only put at most size of iterators into the minimum heap. Using customized comparator 
to maintain the minimum heap. 

//merge k sorted arrays ..  

// leetcode slide window maximum -
// practice leetcode design section .. 
//https://leetcode.com/tag/design/
//https://leetcode.com/tag/backtracking