First of all, I'll freely admit that this is a school project, so I don't want any code. I'm just trying to figure out what I need to actually create a B+ tree. I think I just don't understand how all the "pointers" are supposed to work. I understand that the leaves are where the records are contained, and that is a doubly-linked list, but I don't quite get how the parents will link to them. Does anyone have any good sites that help explain it, or could help explain it themselves? Again, I don't actually want code b/c I want to figure it out, but I just need help.