In a balanced tree data structure, the root element will usually contain a value close to the median of the items that have been added to it. However, because the tree will usually not be perfectly balanced, you may not have the exact median in the root. The exact structure...

algorithm,tree,b-tree,2-3-4-tree,insertion-order

Yes, the sequence of insertions matters. Obviously, the tree will be taller for the same number of keys if more nodes are 1-nodes. They way to maximise the number of 1-nodes in the tree is to continually expand one branch of the tree to 4-nodes, increasing the height of the...