2 votes 2 votes A B-tree of order m is a tree which satisfies the following properties: Every node has at most m children. Every node (except root) has at least ⌈m/2⌉ children maximium no of internal nodes an order 4 B tree can have with 20 keys. Databases gatebook-mt2 data-structures databases b-tree + – smartmeet asked Feb 7, 2017 retagged Aug 5, 2017 by Arjun smartmeet 891 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Akriti sood commented Apr 22, 2017 reply Follow Share but i am also getting maximum as 4 internal nodes. by taking 4 children of root node and then taking 2 children each of these 4 internal nodes 0 votes 0 votes Pat_007 commented Aug 26, 2020 reply Follow Share Considering root as internal node, i;m getting max 5 internal nodes. Akriti sood 0 votes 0 votes Sai eswar commented Oct 24, 2022 reply Follow Share i am getting maximum 2 internal nodes. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes It is 10 kapilbk1996 answered Aug 19, 2018 kapilbk1996 comment Share Follow See 1 comment See all 1 1 comment reply Pat_007 commented Aug 26, 2020 reply Follow Share could you please explain? kapilbk1996 0 votes 0 votes Please log in or register to add a comment.