adplus-dvertising
frame-decoration

Question

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

a.

2, 3 or 4 children

b.

1, 2 or 3 children

c.

2, 4 or 6 children

d.

0, 2 or 4 children

Answer: (b).1, 2 or 3 children

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. In .............. the difference between the height of the left sub tree and height of right sub tree, for each node, is not more than one.

Q. The in-order traversal of a binary tree is HFIEJGZ, and the post-order traversal of the same tree is HIFJZGE. What will be the total number of nodes in the left sub tree of the given tree? (It is NOT a search tree)

Q. If the in-order and pre-order traversal of a binary tree are D,B,F,E,G,H,A,C and A,B,D,E,F,G,H,C respectively then the post-order traversal of that tree is

Q. In a binary tree, the number of terminal or leaf nodes is 10. The number of nodes with two children is

Q. The pre-order traversal of a binary-search tree is DBACFE. What is the post-order traversal?

Q. What could be the worst case height of an AVL tree?

Q. Which amongst the following cannot be a balance factor of any node of an AVL tree?

Q. How many distinct binary search trees can be formed which contains the integers 1, 2, 3?

Q. Level of any node of a tree is

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

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

Q. The number of nodes that have no successors in a complete binary tree of depth 4 is

Q. One can make an exact replica of a Binary Search Tree by traversing it in ...............

Q. A complete Binary Tree with 15 nodes contains ................. edges.

Q. Visiting root node after visiting left and right sub-trees is called .............

Q. A complete binary tree with the property that the value of each node is at least as large as the values of its children is known as ..............

Q. A tree in which, for every node, the difference between the height of its left subtree and right subtree is not more than one is

Q. A binary tree stored using linked representation can be converted to its mirror image by traversing it in ...............

Q. The balance factor for an AVL tree is either

Q. AVL trees have LL, LR, RR, RL rotations to balance the tree to maintain the balance factor (LR : Insert node in Right sub tree of Left sub tree of node A, etc). Among rotations the following are single and double rotations