2 votes 2 votes Construct B+ tree , order=4 ->1,4,7,10,17,21,31,25,19,20,28,42 find key value at root node a.7,17 b.17 c.31,42 d.42 please help me ,unable to do insertion in b+ tree Learner_jai asked Apr 9, 2017 Learner_jai 8.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes by talking order=4 i am not getting any of the option whether if order would be 3 then option 'b' i am getting as answer. bharti answered Apr 10, 2017 bharti comment Share Follow See 1 comment See all 1 1 comment reply Learner_jai commented Apr 10, 2017 reply Follow Share thank you , for explaining. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Since the B+ Tree has order $4$, so the max keys will be $3$. Here is the diagram: Ref: https://www.cs.usfca.edu/~galles/visualization/BPlusTree.html Arunav Khare answered Apr 9, 2017 edited Apr 10, 2017 by Arunav Khare Arunav Khare comment Share Follow See all 2 Comments See all 2 2 Comments reply Learner_jai commented Apr 9, 2017 reply Follow Share This is B+ tree , and the search key values of non-leaf node is not replicate in leaf nodes in your explanation .. B+ tree: all search key values along with their record pointer must present at leaf node. through the process either perform left biasing till end or right biasing till end 0 votes 0 votes Arunav Khare commented Apr 30, 2017 reply Follow Share I don't get what you are saying.. I have made B+ Tree and all keys are present in last level.. what is wrong in it ? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Option B )17 is correct. Monu_ answered Nov 14, 2019 Monu_ comment Share Follow See all 2 Comments See all 2 2 Comments reply srujana bolli commented May 29, 2021 reply Follow Share why did we choose 17 as root ? we should be taking 20 as root right? as it is a right biased 0 votes 0 votes Monu_ commented May 31, 2021 reply Follow Share Srujana bolli , I have clearly mention the formula for leaf node and parent node (also called as non leaf node)splitting method You have been seen in tree (7,17,20,25) is non leaf node , all the other node (number) present below the parent node (I e: 7,17,20,25) . According to parent formula we get 1(I.e: [7]_1st node contain one element & rest element contain [ 17,20,25] )in other node . That's why I had taken 17 as root not 20. If (7 17 20 25) present in a leaf , then acct to leaf formula we get 2. Then (7, 17) as first node and (20,25) other node , that time we will take 20 as a root not 17. I hope your doubt is cleared now 0 votes 0 votes Please log in or register to add a comment.