In SQL 1 The cost of searching a B tree is closely related t

In SQL

1) The cost of searching a B+ tree is closely related to:

a) the number of nodes in the tree

b) the depth of the tree

c) the value of the smallest search key at the root node of the tree

2) All nodes in a B+ tree contain search keys. Pointers to file records are contained in:

a) all nodes

b) leaf nodes only

c) non-leaf nodes only

3) When B+ trees are used in databases, a non-leaf node of the tree will often have a hundred or more child nodes. Why? Is it:

a) because a node is taken to be the same size as a disk block

b) to save on pointer storage

c) to increase disk accesses

1.B) The depth of the tree //It depends on the height of the tree

2. C) Non leaf nodes only//leaf nodes will have actual record

3. B) To save on pointer storage // storage of pointer or keys