I understood AVL tree algorithm but I can't implement it. Please help me!
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | orzdevinwang | 3844 |
3 | jqdai0815 | 3682 |
4 | jiangly | 3618 |
5 | Benq | 3529 |
6 | ksun48 | 3489 |
7 | Radewoosh | 3483 |
8 | Kevin114514 | 3443 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | atcoder_official | 162 |
3 | maomao90 | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
Name |
---|
Nobody uses AVL tree in the contest. Please google: Splay, Treap and SBT, and I recommend the last two.
I'd recommend just Treap if you don't use pascal
What's the full form of SBT?
SBT (or Size-Balanced Tree) was reinvented in late 2006, and published in the 2007 China IOI Camp.
It was said to be an extremely-efficient balanced BST that supports common BST operations and is easy to implement.
Here's a link for reference
I have only just heard about it a while ago though. Never really did look into it.
Update: SBT was reinvented. A paper dating back to 1993
Who said anything about a contest?
Here you can find an implementation of AVL tree i hope it's useful
Thanks everybody!
http://shygypsy.com/tools/bst.cpp