CS301 Quiz Nov 2025 Set 2

Quiz 1 - CS301

Question:

The function calls are made with the help of__________.

A. Stack

B. Dynamic memory C. Heap D. External memory Copied: 11/26/2025, 11:54:26 AM

Quiz 2 - CS301

Question:

What will be level order traversal of the given BST ?

1. 1 2 3 4 5 6 8
2. 1 2 3 4 5 6 8
3. 1 4 3 5 2 8 6
4. 6 2 8 1 5 3 4

Correct answer: 6 2 8 1 5 3 4

Copied: 11/26/2025, 11:54:48 AM

Quiz 3 - CS301

Question:

if( this->left == NULL && this->right == NULL )

If the above condition is satisfied then the current node is:

A. Leaf node

B. Right node C. Root node D. Left node Copied: 11/26/2025, 11:55:09 AM

Quiz 4 - CS301

Question:

Analyze the given code carefully and choose the statement which will be used if we want to set 7 as the value of root ?

int x [] = {14,15,4,9,7,18,3,5,16,4,20,17};

TreeNode * root = new TreeNode(); A. root->setInfo( x );

B. root->setInfo( &x[4] );

C. root->setInfo( &x[0] ); D. root->setInfo( &x ); Copied: 11/26/2025, 11:55:31 AM

Quiz 5 - CS301

Question:

Left, right, info, and parent are the operations of _________ data structure. A. Queue B. Linked List C. Stack

D. Tree

Copied: 11/26/2025, 11:55:52 AM

Quiz 6 - CS301

Question:

Level-order traversal for Binary Search Tree can be implemented, _______________. A. Through both recursive method call and non-recursive method call

B. Only through non-recursive method

C. Only through recursive method D. Through max-heap Copied: 11/26/2025, 11:56:09 AM

Quiz 7 - CS301

Question:

For making Binary Search Tree for Strings we need, ________ data type. A. double B. int C. float

D. char

Copied: 11/26/2025, 11:57:01 AM