title: Finding a median within 2-3-4 tree
body: <p>I'm trying to come up with a simple method to find a median of all the input in the 2-3-4 tree.</p>
  <p>So let say I have already created a tree. Would it be fine to just make it as simple as possible and just dynamically create a new array and add every element in the tree in a sorted manner and find the middle value? (assuming n is always odd number).</p>
  <p>Or would there be a better and more efficient method.</p>