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 | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 149 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | cry | 143 |
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'