adplus-dvertising
frame-decoration

Question

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

a.

2

b.

3

c.

4

d.

5

Answer: (c).4

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

Q. Heap is an example of ................

Q. The number of unused pointers in a complete binary tree of depth 5 is:

Q. The running time for creating a heap of size n is .............

Q. One can determine whether a Binary tree is a Binary Search Tree by traversing it in ................

Q. The maximum number of nodes in a binary tree of depth 5 is ...............

Q. In a min-heap:

Q. A complete binary tree with n leaf nodes has ..............

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

Q. Which one of the following statements is false?

Q. A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?

Q. Which of the following need not to be a binary tree ?