718 views
2 votes
2 votes

Consider a B+ Tree of height $h$ and order of root node $p$ and order of leaf node $q$. Find ?

  • Time complexity to find a record in B+ Tree
  • Minimum and Maximum number of records stored in B+ Tree

1 Answer

0 votes
0 votes

Time complexity of searching in Btree is O(log n).

Root node should contain atleast 2 children. Internal nodes has atleast $Ceil(\frac{n}{2})$.

And if parent node has (n-1) keys then it can have atmost n children.

All leaf node appear in the same level from left to right and each leaf node has a pointer to the next leaf.

Related questions

0 votes
0 votes
0 answers
1
2 votes
2 votes
2 answers
2
0 votes
0 votes
3 answers
3
Na462 asked Feb 2, 2019
2,043 views
0 votes
0 votes
0 answers
4
bts1jimin asked Jan 9, 2019
375 views
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?