title: B trees vs binary trees
body: <p>If I am implementing in-memory(RAM) search operation with b trees, then would it be better in terms of caching or some other effects when compared with binary trees?</p>
  <p>What I know is-</p>
  <pre><code>binary search tress---O(log n)
  btrees ---------------O(c log n)
  </code></pre>
  <p>there was a lot of discussion regarding that on various blogs.</p>