7 votes 7 votes If a node has $K$ children in $B$ tree, then the node contains exactly _____ keys. $K^2$ $K-1$ $K+1$ $\sqrt{K}$ Databases isro2015 databases b-tree + – go_editor asked Jun 19, 2016 go_editor 3.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 11 votes 11 votes answer is B : K-1 keys rameshbabu answered Jun 19, 2016 selected Jun 27, 2016 by Anu rameshbabu comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes if it has k children then it has k pointers so it must contain k-1 keyvalues Pavan Kumar Munnam answered Sep 9, 2016 Pavan Kumar Munnam comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Structure of Internal Nodes of B tree and leaves of B tree are same. If a node has K children (Block pointers) then K-1 keys will be there. option B akash.dinkar12 answered Apr 14, 2017 akash.dinkar12 comment Share Follow See all 0 reply Please log in or register to add a comment.