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?
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
Name |
---|
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'
can you please provide the drive link again