> Ever implemented a balanced binary tree? Me neither, seems a pain! Red-Black, AVL, rotation, uncles/aunts, balance factors, sub-trees - that's a lot to keep track of.
Yeah, because they give you pretty darn strong deterministic guarantees.
> Luckily the world of computer science has a data structure that is far easier to implement and has similar properties: the skiplist.
It's far easier to implement... and it doesn't provide the same guarantees.
Yeah, because they give you pretty darn strong deterministic guarantees.
> Luckily the world of computer science has a data structure that is far easier to implement and has similar properties: the skiplist.
It's far easier to implement... and it doesn't provide the same guarantees.