title: complexity of turning a sorted array to a 2-4 B tree
body: <p>What is the complixety of turning a sorted array of size n to a legal 2-4 B tree?</p>
  
  <p>What would it be if the array wasn't sorted.</p>
  
  <p>I believe that the first answer should be <code>O(logn)</code> (As many splits that we'll have to do) and the second answer should be O(nlogn+logn)=O(nlogn), because of the sorting.</p>
  
  <p>Thank you.</p>