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 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
| 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'