https://en.wikipedia.org/wiki/B-tree#Initial_constructionCurrently I know of 2 ways for building a B-Tree : bulkloading and just inserting key after key.In the wiki example the keys are sorted, which I guess is a condition for this bulkloading concept.What is the advantage of bulkloading if the keys are unsorted ? because I have to sort them myself still resulting in O(nlogn) , same as inserting key after key in the B-Tree.Thanks.
Advantage of bulkloading in a B-Tree
data structures;search trees;efficiency;balanced search trees