title: Merge of Skip Lists
body: <p>How can I merge 2 given <code>Skip lists</code> (each with n keys) into a one single <code>Skip List</code> in <code>O(n)</code> time complexity (worst case)?</p>
  
  <p>Just looking for the algorithm - no particular implementation/language.</p>