Sequence of insertions when generating B-Tree / 2-3-4 tree

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...

Insertion-Order Dictionary (like Java's LinkedHashMap) in Swift?

swift,dictionary,insertion-order

Didn't know of one and it was an interesting problem to solve (already put it in my standard library of stuff) Mostly it's just a matter of maintaining a dictionary and an array of the keys side-by-side. But standard operations like for (key, value) in od and for key in...