>>13157820You can always create a new data structure. The hard part is recognizing whether or not it does its job significantly better than existing ones.
For example, among tree structures, here are some of the most useful ones:
Red black / AVL
random trees (percolation models)
van-Emde Boas trees
Fusion trees
Other trees are interesting but don’t warrant as much study since they’re specialized and can be understood by knowing the classics first. I’m of course talking about splay trees.
