New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Map - treap(ADT) [O] #18

Open

azram19 opened this issue Jun 6, 2011 · 0 comments

Labels

Owner

azram19 commented Jun 6, 2011

I chose a treap, because it's almost as efficient as br-tree and AVL, being simple at the same time.

http://www.cs.uiuc.edu/class/sp09/cs473/notes/08-treaps.pdf

restore_treap(...)
rotate_tree(...)
get_priority(...) //should be random

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment