Question #

A complete binary tree is a tree that is _

Select correct option:

partially**completely (Page No. 326)**

incompletely

partly

Question #

If one pointer of the node in a binary tree is NULL then it will be a/

Select correct option:**Inner node**

Leaf node

External node

Root node

Question #

In case of insertion of left outer node in BST,

Select correct option:**we apply single right rotation to make it AVL Tree.**

we apply single left rotation to make it AVL Tree.

we first apply right rotation and then left rotation to make it AVL Tree.

we first apply left rotation and then right rotation to make it AVL Tree.

Question #

For a perfect binary tree of height 4.

Select correct option:

31

30

27**26**

Question #

Consider a min heap,

Select correct option:**10, 30,20,31,40,50,80,60,70**

10,

10,

31,

Question #

A tree is an AVL tree if

Select correct option:

Any one node fulfills the AVL condition

At least half of the nodes fulfill the AVL condition

**All the nodes fulfill the AVL condition**

None of the given options

Question #

Consider a min heap,

Select correct option:

3,

3,

1,

**1,**4,3,7,5,10,6

Question #

If the height of a perfect binary tree is 4.

Select correct option:

15

16

**31**

32

Question #

Which of the following statement concerning heaps is NOT true?

Select correct option:

**A heap can be stored in a binary search tree.**

A heap can be stored in an array.

A heap can be used to implement a priority queue.

A heap can be used to sort data.

Question #

Consider a binary tree,

Select correct option:

Yes

**No**