A search tree is a data structures which represents a set of elements.A 2-3 tree and  a B-tree are search trees. The elements of the sets they represent are placed only in the leaves of the search trees.A binary search tree is also a search tree. But the elements of the set a binary search tree represents are placed in all the nodes, including the internal nodes.Why is there the difference?What kinds of search trees place the elements of the sets they represent only in leaves? What kinds of search trees place the elements of the sets they represent in all the nodes?Thanks.
Why do some search trees place the elements of the sets they represent in leaves only, while some in all the nodes?
data structures