title: Why are there two leaf nodes in this B-Tree lookup?
body: <p>In this</p>
  
  <p><a href="https://i.stack.imgur.com/JQq6h.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/JQq6h.png" alt="enter image description here"></a></p>
  
  <p>graphic, we are looking up employee_id 123 and subsidary_id 20 in a B-Tree (from a tutorial on database indexes). There are two leaf nodes branching off the tree. Is this purely demonstration, or is there something I'm missing, as I would think that the only leaf node that would need to be checked would be the top one, as it has employee_id max 123 and subsidary_id max 27.</p>