CS301 Quiz 3 by VU Topper RM

A. Expression tree B. Threaded binary tree

C. Complete Binary tree Page 323

D. Perfectly complete Binary tree

There are four cases of rotation in an __________ tree.

A. AVL

B. Tree C. Binary D. Heap

Which type of rotation can balance the following AVL tree?

1. Single left
2. Single right
3. Double right-left
4. Double left-right Google

Correct answer: Double left-right Google

Finding the minimum is easy; it is _____ of the min heap.

A. Top Page 351

B. Left most child. C. Right most child D. None of the given options.

When a complete binary tree, represented by an array then for any array element at position i, the parent is at position ______ . A. 2i B. 2i-1 C. (2i+1)

D. Floor(i/2)

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

1. 55
2. 56
3. 57 Page 303
4. 58

Correct answer: 57 Page 303

In an expression tree, a unary operator will have only ________ subtree.

A. One Google

B. Two C. Three D. None

Consider a min heap, represented by the following array: 3,4,6,7,5,10 After inserting a node with value 1. Which of the following is the updated min heap? A. 3,4,6,7,5,1,10

B. 1,4,3,7,5,10,6 Google

C. 1,4,6,7,5,10,3 D. 3,4,6,7,5,10,1

For the inorder traversal of threaded binary tree, we introduced a dummy node. The left pointer of the dummy node is pointing to the ________ node of the tree. A. Root

B. Left must

C. Right must D. any of the given node

If both pointers of the node in a binary tree are NULL then it will be a/an

A. Leaf node

B. Root node C. Inner node D. None of the given options

In complete binary tree the bottom level is filled from ________

A. Left to right

B. Right to left C. Not filled at all D. None of the given options

Consider a max heap, represented by the following array: 40,30,20,10,15,16,17,8,4 After inserting a node with value 35. Which of the following is the updated max heap?

A. 40,30,20,10,15,16,17,8,4,35

B. 40,35,20,10,30,16,17,8,4,15 C. 40,30,20,10,35,16,17,8,4,15 D. 40,35,20,10,15,16,17,18,4,30

A complete binary tree of height 3 has between ________ nodes. A. 8 to 17 B. 8 to 14

C. 8 to 15

D. 8 to 17

To develop a character encoding scheme in Huffman tree, _______ will be assigned to left branch. A. 1 B. 2

C. 3 Page 301

D. 4

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

1. 20