0 votes 0 votes The maximum number of nodes in a B-tree of height h and degree t is(depth of root is 0) : (A) 2t$^{h}$ – 1 (B) t$^{h}$ – 1 (C) $\frac{t^{h+1} - 1}{t-1}$ (D) $\frac{t^{h} - 1}{t-1}$ saurav raghaw asked Jan 2, 2019 saurav raghaw 4.3k views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments saurav raghaw commented Jan 3, 2019 reply Follow Share I correct it. Thanx 0 votes 0 votes saurav raghaw commented Jan 3, 2019 reply Follow Share @Shobhit Joshi what will be the case when root at level 1? 0 votes 0 votes Shobhit Joshi commented Jan 3, 2019 reply Follow Share @saurav raghaw doesn't matter still the height is h and you have $h+1$ levels 0 votes 0 votes Please log in or register to add a comment.