A B-tree of order 4 and of height 3 will have a maximum of keys.

Related MCQs

• What is the best case height of a B-tree of order n and which has k keys?
• The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
• The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is
• Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
• What is the maximum height of an AVL tree with p nodes?
• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if
• What is the average retrieval time when n keys hash to the same slot?
• The possibility of two different keys k1 & k2 yielding the same hash address is called__________.
• A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?