The percolateDown procedure will move the smaller value____ and bigger value______.

• A) left,right
• B) down,up
• C) right,left
• D) up,down

There will be ________ external nodes in a binary tree, if we will have N internal nodes.

• A) N – 1
• B) 2N
• C) N + 1
• D) N/2

If the bottom level of a binary tree is not completely filled, depicts that the tree is not a _______.

• A) Threaded binary tree
• B) Perfectly complete binary tree
• C) complete binary tree
• D) Expression tree

If there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

• A) N-1
• B) N+1
• C) N+2
• D) N

An expression tree that has only binary operators will always be a/an,

• A) Strictly binary tree
• B) AVL tree
• C) Binary search tree
• D) Heap

Consider a binary tree, represented by the following array:
10,7,9,5,2,1,6,3,4

This is a ________.

• A) Threaded binary tree
• B) Binary Search tree
• C) Max heap
• D) Min heap

Which one of the following is best for traversals,

• A) Heap
• B) AVL tree
• C) Binary Search Tree
• D) Threaded Binary Tree

Consider a min heap, represented by the following array:
11,22,33,44,55

After inserting a node with value 66.Which of the following is the updated min heap?

• A) 11,22,66,33,44,55
• B) 11,22,33,66,44,55
• C) 11,22,33,44,66,55
• D) 11,22,33,44,55,66

When a complete binary tree, represented by an array then for any array element at position i, the right child is at position ______ .

• A) 2i-1
• B) 2i+1
• C) floor(i/2)
• D) 2i

In deletion, ________ method reorganizes the min heap.

• A) DecreaseKey
• B) PercolateDown
• C) IncreaseKey
• D) Percolate_Below

One requirement to construct a max heap tree is _________.

• A) The tree must be binary search three
• B) The tree must be strictly binary tree
• C) The tree must be AVL tree
• D) The tree must be complete binary tree

A binary tree with 33 internal nodes has _______ links to internal nodes.

• A) 34
• B) 31
• C) 33
• D) 32

A binary tree with 45 internal nodes has _______links to external nodes.

• A) 45
• B) 46
• C) 90
• D) 44

In heap data structure, the time required for insert() method will be proportional to ___________.

• A) N2
• B) Nlog2N
• C) log2n
• D) N

To develop a character encoding scheme in Huffman tree, _______ will be assigned to right branch.

• A) 1 and 0
• B) 1
• C) -1
• D) 0

Consider a min heap, represented by the following array: 5, 6, 8, 9, 7, 12 What will be the status of array after inserting a new node with value 3?

• A) 3, 5, 6, 8, 9, 7, 12
• B) 3, 6, 8, 9, 7, 5, 12
• C) 3, 6, 5, 9, 7, 12, 8
• D) 3, 6, 5, 7, 9, 12, 8

When a complete binary tree, represented by an array then for any array element at position i, the parent is at position ______ .

• A) 2i-1
• B) 2i
• C) floor(i/2)
• D) 2i+1

If there are N internal nodes in a binary tree then what will be the no. of external nodes in this binary tree?

• A) N+2
• B) N-1
• C) N
• D) N+1

In Huffman character codes, letters with higher frequencies have _______ code(s).

• A) Shorter
• B) Not less than 4 bits
• C) Not more than 1 bit
• D) Larger

Which of the following is a property of binary tree?

• A) A binary tree of N external nodes has N+ 1 internal node.
• B) A binary tree of N internal nodes has N- 1 external node.
• C) A binary tree of N internal nodes has N+ 1 external node.
• D) A binary tree of N external nodes has N internal node.