Data Structures and Algorithms Mcq Archives | Page 2 of 20

(A) Every binary tree has at least one node
(B) Every non-empty tree has exactly one root node
(C) Every node has at most two children
(D) Every non-root node has exactly one parent

►Correct Option

Tag: Data Structures and Algorithms Mcq

Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays below, determine the one that cannot possibly be a heap.

Select the one false statement about binary trees:

Searching an element in an AVL tree take maximum __ time (where n is no. of nodes in AVL tree).

__ only removes items in reverse order as they were entered.

We are given N items to build a heap, this can be done with __ successive inserts.

Which one of the following algorithms is most widely used due to its good average time?

A complete binary tree of height 3 has between __ nodes.

Which of the following method is helpful in creating the heap at once?