Top 80+ Solved Non Linear Data Structures - Trees MCQ Questions Answer
Q. What is the best case height of a B-tree of order n and which has k keys?
a. logn (k+1) – 1
b. nk
c. logk (n+1) – 1
d. klogn
Q. Which of the following is true?
a. larger the order of B-tree, less frequently the split occurs
b. larger the order of B-tree, more frequently the split occurs
c. smaller the order of B-tree, more frequently the split occurs
d. smaller the order of B-tree, less frequently the split occurs
Q. In a max-heap, element with the greatest key is always in the which node?
a. Leaf node
b. First node of left sub tree
c. root node
d. First node of right sub tree
Q. What is the complexity of adding an element to the heap.
a. O(log n)
b. O(h)
c. O(log n) & O(h)
d. O(n)
Q. The worst case complexity of deleting any arbitrary node value element from heap is
a. O(logn)
b. O(n)
c. O(nlogn)
d. O(n2)
Q. An array consists of n elements. We want to create a heap using the elements. The time complexityof building a heap will be in order of
a. O(n*n*logn)
b. O(n*logn)
c. O(n*n)
d. O(n *logn *logn)