If a node has K children in a B tree, then the node contains exactly _______ Keys.

In a Binary Search Tree, the left subtree of a node contains only nodes with keys _______ the node’s key.

A tree data structure whose shape obeys the following definition,o    A node contains one or two keyso    Every internal node has either 2 children if it contains 1 key or 3 children if it contains two keyso    All leaves are at the same level in the tree Is called a/an:Question 9Select one:a.B*-Treeb.BSTc.B+-Treed.2-3 tree

In a B+ tree, both the internal nodes and the leaves have keys.

In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is:

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