6 votes 6 votes Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and right biasing approach.Plz present any example to show if possible.. Databases databases b-tree indexing + – Habibkhan asked Oct 19, 2016 retagged Aug 5, 2017 by Arjun Habibkhan 1.1k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Prashant. commented Oct 19, 2016 reply Follow Share https://gateoverflow.in/75163/b-tree-insertion You solved this :) 1 votes 1 votes Habibkhan commented Oct 19, 2016 reply Follow Share But I considered left biasing only there..:) 0 votes 0 votes chandler bing commented Dec 9, 2018 reply Follow Share So what is the default biasing we need to use in GATE exam? 0 votes 0 votes Please log in or register to add a comment.
Best answer 6 votes 6 votes Just give a try for this => 10, 3, 6, 8, 4, 2, 1 A). Use left biasing --> total 5 splits (4 leaf node and 1 internal node) B). Use right biasing --> total 4 splits (3 leaf and 1 internal node) Kapil answered Oct 19, 2016 selected Oct 19, 2016 by Habibkhan Kapil comment Share Follow See all 4 Comments See all 4 4 Comments reply Habibkhan commented Oct 19, 2016 reply Follow Share Ok thanks a lot @Kapilp 1 votes 1 votes parulk commented Jan 24, 2017 reply Follow Share so how we will decide which biasing to use? 1 votes 1 votes Sona Barman commented Jan 22, 2018 reply Follow Share Order of internal node and leaf node ? 0 votes 0 votes sachin486 commented Oct 6, 2020 reply Follow Share order 2 0 votes 0 votes Please log in or register to add a comment.