EEE -A DS Quiz -4

what is maximum number of children a node in binary Tree can have

• 2

• 3

• 0

• 1

In a binary tree, what is the term for the node with no children

• Root

• Leaf

• Parent

• Sibling

how many edges does a full binary tree with n nodes have?

• n

• n-1

• 2*n+1

• 2*n+2

What are null nodes filled with in a threaded binary tree?

• inorder predecessor for left node and inorder successor for right node information

• right node with inorder predecessor and left node with inorder successor information

• they remain null

• some other values randomly

which traversal method of a binary tree involves visiting the left subtree, then the root, and then the right sub tree?

• inorder

• preorder

• postorder

• level order

With what data structure can a priority queue be implemented?

• Array

• List

• Heap

• Tree

Which of the following is not an application of priority queue?

• Huffman codes

• Interrupt handling in operating system
  

• Undo operation in text editors

• Bayesian spam filter

Min heap is a complete binary tree.

• True
  
  

• False

What will be the position of 5, when a max heap is constructed on the input elements 5, 70, 45, 7, 12, 15, 13, 65, 30, 25?

• 5 will be at root

• 5 will be at last level

• 5 will be at second level

• 5 can be anywhere in heap

The max heap constructed from the array of numbers A[]={30, 10, 80, 60, 15, 55} is

• 80 55 60 15 10 30

• 80 60 55 30 10 15

• 60 80 55 30 10 15

• 80 60 55 10 15 30