0 0 votes closed with the note: duplicate: https://gateoverflow.in/2279/gate1997_19 A B+ tree of order 'd' is a tree in which each internal node has between 'd' and '2d' keys values. The root has between 1 and '2d' values. What is the maximum number of internal nodes in a B+ tree of order 4 with 52 leave?? Databases + – papesh 734 views comment Share Follow Print See all 4 Comments 4 4 Comments reply venkat_sirvisetti commented May 9, 2017 i edited by venkat_sirvisetti May 9, 2017 reply Follow flag I think answer is 13 0 0 replyShare venkat_sirvisetti commented May 9, 2017 reply Follow flag Here minimum no of children for non root internal node is 5 and maximum is 9. So 10 nodes are sufficient to hold 52 leaves. Likewise, 2 level 1 nodes are sufficient for holding the 10 level 2 nodes. Hence a total of 13 are sufficient 0 0 replyShare akash.dinkar12 commented May 9, 2017 reply Follow flag plz correct me if i m wrong... 0 0 replyShare venkat_sirvisetti commented May 9, 2017 reply Follow flag Minimum number of leaves of a B+ Tree is order+1. So, here there must be minimum 5 children and maximum 9 children for an internal non-root node. Reference : https://gateoverflow.in/2279/gate1997_19 0 0 replyShare Please log in or register to add a comment.
