1 votes 1 votes For any B-tree of minimum degree t $\geq$ 2, every node other than the root must have at least ____ keys and every node can have at most ____ keys. t-1, 2t+1 t+1, 2t+1 t-1, 2t-1 t+1, 2t-1 Algorithms ugcnetcse-dec2013-paper2 algorithms b-tree + – go_editor asked Jul 25, 2016 edited May 28, 2020 by soujanyareddy13 go_editor 3.7k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shubham Pandey 2 commented Sep 19, 2016 reply Follow Share is degree is same as order of tree 0 votes 0 votes Sanjay Sharma commented Nov 12, 2017 reply Follow Share no order is max no of children(pointers) a node can have degree is different which gives range of children and keys 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes In B tree every internal node other than the root is at least half-full, i.e. t-1≤ #keys ≤2t-1, t≤ #children ≤2t Hence,Option(C)t-1 , 2t-1. Reference:-http://www2.hawaii.edu/~milica/ics311/B-Trees.doc LeenSharma answered Jul 25, 2016 selected Sep 19, 2016 by Sankaranarayanan P.N LeenSharma comment Share Follow See 1 comment See all 1 1 comment reply Shubham Pandey 2 commented Sep 19, 2016 reply Follow Share what is degree 0 votes 0 votes Please log in or register to add a comment.