B-trees

**1.**B Trees are generally

**2.**A B-tree of minimum degree t can maximum _____ pointers in a node.

**3.**Every internal node in a B-tree of minimum degree 2 can have

**4.**In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.

**5.**The order of a B-Tree with 2, 3, 4 or 5 children in every internal node is

**6.**The smallest number of key that will force a B-tree of order 3 to have a height 3 is

**7.**B+- trees are preferred to binary trees in databases because