View Forum Topic

Forums
CS422
B-Tree properties : Leaf node

Author	Message
talisunep Posts: 140	Posted 21:23 Dec 02, 2013 \| hi Professor Sun, had a small doubt slide states Nodes (except root) must be at least half full •Internal node:ceiling of (n+1)/2 pointers •Leaf node: floor of (n+1)/2 pointers in the slide example where n = 3 hence Leaf node = 2 pointers but in the slide in the leaf node there are three pointers? Attachments: Screen Shot 2013-12-02 at 9.17.09 PM.png
cysun Posts: 2935	Posted 08:11 Dec 03, 2013 \| It's "at least" 2 pointers, meaning for n=3, a leaf node must have at least 2 pointers to be considered "half full".

Author

Message

talisunep

Posts: 140

Posted 21:23 Dec 02, 2013 |

hi Professor Sun,
had a small doubt
slide states
Nodes (except root) must be at least half full
•Internal node:ceiling of (n+1)/2 pointers
•Leaf node: floor of (n+1)/2 pointers

in the slide example where
n = 3
hence Leaf node = 2 pointers but in the slide in the leaf node there are three pointers?

Attachments:

Screen Shot 2013-12-02 at 9.17.09 PM.png

cysun

Posts: 2935

Posted 08:11 Dec 03, 2013 |

It's "at least" 2 pointers, meaning for n=3, a leaf node must have at least 2 pointers to be considered "half full".