Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

olad

Name: Anonymous 2008-03-29 7:03

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

Name: Anonymous 2008-03-30 0:22

>>26
AVL trees are simpler and the proofs are quite similar to rb. But AVL have much faster searchs since the tree height is bound by 1.44*log(n). AVL FTW.

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List