Data Structures

1: The smallest number of key that will force a B-tree of order 3 to have a height 3 is

A.	12
B.	10
C.	7
D.	None of these
	Answer : C Explanation : Write your comments here: Updating your Comments.. Updating your Comments.. Report Error
	Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Suggest an improvement