I was looking for some good tutorial on B-trees. I am new to this data structure and would like you explore it in detail. Any suggestions?
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
And also I'd like to ask, if there exist ACM-like problems, where that is absolutely necessary to implement such complicated data structures as B/B+/AVL/Red-Black trees on your own and set/map can't be used instead.
https://drive.google.com/folderview?id=0Bw-SsYVOTRT9NWw5Unh1blBaR0k&usp=sharing&tid=0Bw-SsYVOTRT9V0czaF9FOE1POWc
I recommend you those vidoes, are about balanced search trees (including B-Tree).
The videos are from 'Algorithms Part 1 — Robert Sedgewic and Kevin Wayne'