1 votes 1 votes What is the maximum number of nodes and keys in a B-tree of order 10 of depth 3 (root at depth 0) ? DS b-tree data-structures + – rishu_darkshadow asked Sep 25, 2017 rishu_darkshadow 2.0k views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Shivam Chauhan commented Sep 25, 2017 reply Follow Share Please explain Branching Factor in B-tree 0 votes 0 votes rishu_darkshadow commented Sep 25, 2017 reply Follow Share https://cs.stackexchange.com/questions/7428/b-tree-branching-factor-boundaries 0 votes 0 votes utk0203 commented Oct 28, 2017 reply Follow Share https://www.youtube.com/watch?v=TOb1tuEZ2X4 At 6:00 it is saying so B<= children < 2B-1 , so here it should be maximum of 19 children and B-1<= keys < 2B-1 so total number of keys would be 18+19*18+19*19*18 = 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Try this way ! Parveen Chahal answered Oct 6, 2017 Parveen Chahal comment Share Follow See all 0 reply Please log in or register to add a comment.