Is there a search tree where union is associative, so $a \cup (b \cup c) = (a \cup b) \cup c$ gives a tree with the same structure?
A complete binary tree would be such a tree, but for example a red-black tree has several possible constructions for a given set of elements.
Is there such a tree that does better than $O(n)$ for common operations such as insert or delete?
