title: B-Tree for on-disk storage
body: <p>Why is a B-Tree the preferred structure for on-disk storage.<br>
  What quality makes it preferrable over a binary tree for secondary storage.<br>
  Is that specific 'quality' a feature of the alogrithm itself;or the way in which it is implemented?<br>
  Any reference or pointer would be much appreciated.</p>