491 views
0 votes
0 votes
Consider search field V= 9bytes block size B= 512 bytes record pointer Pr=7 bytes and block pointer Pb is 6 bytes. How many children can a node have or order of tree so that each node can come in a single block

How is the answer 23?? I am getting 24.

1 Answer

Best answer
1 votes
1 votes

Yes, Number of children a node can have or Order of a tree is 24.

 The number of keys in a block will be =>  (Order -1) i.e. 23.

 

selected by

Related questions

0 votes
0 votes
1 answer
1
rahul sharma 5 asked Jan 7, 2017
2,325 views
I know advantages of btree. But after reading that I want to ask in what aspect Avl trees are useful over b tree? Give some example please.
1 votes
1 votes
3 answers
2
Hira Thakur asked Nov 30, 2016
500 views
find minimum no of levels are req to index 14000 records in a btree of ordre 11??
0 votes
0 votes
1 answer
4
phaniphani asked Nov 16, 2023
176 views
is it allowed in a B+ tree, while deletion to leave behind a key in internal nodes while deleting it from the leaf ?