ADS live quiz

1. Consider the following singly linked list wherein each node of the linked list contains a data (integer) and a link pointing to the next node:

What would be the output of the following code if the initial call is func(head)?

void func(node * root)

{

if(!rootà link)

return;

func(rootàlink);

printf(“%d”,rootàdata);

}

• 20,5,15,10

• 10,15,5,20

• 20

• None

The preorder traversal of binary search tree is : 50,17,12,9,14,23,19,72,54,67,76. The inorder successor of 14 is .......

The preorder traversal of a binary search tree is : 50,17,12,9,14,23,19,72,54,67,76. The number of nodes having only left child in the BST will be

• 0

• 1

• 2

• 3

A priority queue is implemented as a MAX-Heap. Initially it has 5 elements. The level order traversal of the heap is 10,8,5,3,2. Two new elements 1 and 7 are inserted into the heap in that order. The level order traversal of the heap after the insertion of elements is:

• 10,8,7,3,2,1,5

• 10,8,7,2,3,1,5

• 10,8,7,1,2,3,5

• 10,8,7,5,3,2,1

what is the postorder traversal of given tree?

• 7,15,17,22,27,30,45,60,75

• 7,22,17,27,15,45,75,60,30

• 7,17,27,22,15,45,75,60,30

• 30,15,7,22,17,27,60,45,75

Which tree is suitable for applications dealing with frequent searching?

• Binary tree

• AVL tree

• Red-Black tree

• Full binary tree

In a threaded binary tree, left thread is attached to

• root node

• inorder predecessor

• inorder successor

• preorder successor

If balance factor of any node in a BST is greater than ...,(ignoring sign) then tree needs rotations

In Red-Black tree, if color of uncle node is red and we have consecutive red nodes in the tree then there need

• balancing

• recoloring only

• rotation only

• recoloring and rotation

How do you like this quiz?

• Excellent

• V. Good

• Good

• Moderate