retagged by
6,286 views

1 Answer

11 votes
11 votes
Left biasing - when the node is full and you select an element to split a node such that left subtree has more keys than right subtree. Same with right biasing.

Related questions

6 votes
6 votes
1 answer
1
firki lama asked Jan 14, 2017
5,897 views
which formula should we use for calculating LEAF node in B+ tree?I. n*(K+r)+b<=block sizewhere n=no of keysk=key size,r=record pointer,b=block pointerII. (n-1)(K+r)+b<=bl...
0 votes
0 votes
1 answer
2
iarnav asked Dec 15, 2017
1,366 views
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
1 votes
1 votes
1 answer
3