I understood AVL tree algorithm but I can't implement it. Please help me!
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | Petr | 145 |
| 9 | pajenegod | 145 |
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