2 votes 2 votes Consider a B-tree of order 15 with 3 levels [Root is at level 1]. The maximum possible no of keys which can be indexed in the above B tree is...Plz give proper explanation neha singh asked Sep 20, 2016 neha singh 258 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes total no of keys= total no of keys at level 1,2,3 Shubham Pandey 2 answered Sep 20, 2016 Shubham Pandey 2 comment Share Follow See all 0 reply Please log in or register to add a comment.