<div>
<div class="content wysiwyg-content">
If multiple identical keys are put into a b-tree, how would it be possible to retrieve all of them? &nbsp;If for example, you have 5 keys per node, and you insert 15 keys into an empty tree, the root node would be split. &nbsp;Then during a retrieval, the retrieval function would find all duplicate keys in the root node, and then continue searching in the right node, but the keys in the left node would be lost.<br />
<br />
So, how is this problem usually handled? &nbsp;Do you need to make some kind of separate nodes that store all duplicate keys?
</div>
</div>


If multiple identical keys are put into a b-tree, how would it be possible to retrieve all of them?  If for example, you have 5 keys per node, and you insert 15 keys into an empty tree, the root node would be split.  Then during a retrieval, the retrieval function would find all duplicate keys in the root node, and then continue searching in the right node, but the keys in the left node would be lost.

So, how is this problem usually handled?  Do you need to make some kind of separate nodes that store all duplicate keys?

b-tree with duplicate keys

C is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations. By design, C provides constructs that map efficiently to typical machine instructions, so it has found lasting use in applications that had formerly been coded in assembly language, including operating systems as well as various application software for computers ranging from supercomputers to embedded systems. It is distinct from C++ (which has its roots in C) and C#, and many later languages have borrowed directly or indirectly from C.