Question #

If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?

Select correct option

54

55

56**57**

Question #

If the bottom level of a binary tree is NOT completely filled,

Select correct option:**Complete Binary tree**

Threaded binary tree

Expression tree

Perfectly complete Binary tree

Question #

If the height of a perfect binary tree is 4.

Select correct option:

15

16**31**

32

Question #

By using _

Select correct option:

Binary tree only**Threaded binary tree**

Heap data structure

Huffman encoding

Question #

Which of the following statement is NOT true about threaded binary tree?

Select correct option:

Right thread of the right-

Left thread of the left-

The left pointer of dummy node points to the root node of the tree.**Left thread of the right- most node points to the dummy node.**

Question #

The total number of nodes on 5th level of a perfect binary tree are :

Select correct option:

16

15

31

32

Question #

We implement the heap by _

Select correct option:

Threaded Tree

AVL tree

**Complete binary tree**

Expression

Question #

While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.

Select correct option:

Equal to the small frequency

Equal to the greater

**Equal to the sum of the two frequencies**

Equal to the difference of the two frequencies

Question #

Consider a min heap,

Select correct option:

4,

6,

**4,**5,6,7

4,

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