olad

itt we name our fav data structure

I have 2 favorite ones (I couldn't decide to go for just one of them):
- Skip Lists
- Dancing Links

>>34
If n is 2, then O(log n) is O(1). If n is 1, then it is O(0). You can't beat O(0). The gist of it is, keep your tree smaller than 2 nodes, and you will be alright.