数据结构10.3.B+树.pdfVIP

+ B -Trees • Same structure as B-trees. • Dictionary pairs are in leaves only. Leaves form a doubly-linked list. • Remaining nodes have following structure: j a k a k a …k a 0 1 1 2 2 j j • j = number of keys in node. • a is a pointer to a subtree. i • k = smallest key in subtree a and largest i i in a . i-1 Example B+-tree