ISRO exam 2017 – Question 67 with Solution

In this video we are going to discuss another question which was asked in the exam of ISRO

67. A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are

(a) 5

(b) 4

(c) 1

(d) 2