234 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?

1 Answer

1 votes
1 votes
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

0 votes
0 votes
1 answer
1
gauravkumawat asked Jun 13, 2023
880 views
please solve in paper formet Explain the properties of B-Tree Also Construct B+ tree with order P=410,5,30,40,20,17,90,45,93,60,20,50,29
2 votes
2 votes
2 answers
3
1 votes
1 votes
0 answers
4
Souvik33 asked Oct 30, 2022
391 views
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...