Question

construct b tree of order 3 having keys using 25, 7 ,8 , 9 ,10, 12 ,1 6 ,18 ,3​

Answer 1

Answer:

B+ Tree Example

• A balanced tree

• Each node can have at most m key fields and m+1 pointer

fields

• Half-full must be sa@sfied (except root node):

• m is even and m=2d

– Leaf node half full: at least d entries

– Non-leaf node half full: at least d entries

• m is odd and m = 2d+1

– Leaf node half full: at least d+1 entries

– Non-leaf node half full: at least d entries (i.e., d+1

pointers)