in Databases
139 views
0 votes
0 votes
1. Suppose there is a B-tree, such that internal node with order 86 and leaf node with order 103.
2. A B+ tree with internal order is 171 and leaf node with order 103.

In both scenarios what is the order of the tree?
in Databases
139 views

1 Answer

1 vote
1 vote
In B tree there are the order is same for both leaf and internal nodes which defines no of children the nodes has.

So i think first statement is incorrect.

for the second one B+ trees leaf node order defines maximum no of key value and record pointer the node can have which is it can can have 103 <key ,record pointer> in each node.

and order of internal node defines maximum no of child pointer an internal node can have.

so here it can have maximum 171 child node or 170 <key ,block pointer >  in each node.

Related questions

2 votes
2 votes
2 answers
2