title: Is a B-Tree of order 2 a full binary tree?
body: <p>When I made a search for the above question I got an answer <code>Yes</code>.</p>
  
  <p>The definition for a full binary tree is as follows :</p>
  
  <blockquote>
    <p>A full binary tree (sometimes proper binary tree or 2-tree) is a tree in which every node other than the leaves has two children.</p>
  </blockquote>
  
  <p>But the issue is that, this property might not be satisfied every time I construct a B-Tree of order 2.</p>
  
  <p>For example : </p>
  
  <blockquote>
    <p>Insert 10,17,45 in a B-Tree of order 2</p>
  </blockquote>
  
  <p>The structure that we get is</p>
  
  <pre><code>10
     17
        45
  </code></pre>
  
  <p>which is not a full binary tree.</p>
  
  <p>So why is it said that a B-Tree of order 2 a full binary tree?</p>