CS301 Quiz No.2 Shared by Tayyeba

Binary search algorithm can not be applied to ____
Select correct option:
sorted linked list
sorted binary trees        ok
sorted linear array
pointer array


During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition.
Select correct option:
It will not have left child        ok
It will not have right child
It will not have both left and right children
None of given options


Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Select correct option:
Input-restricted deque
Output-restricted deque
Priority queues        ok


A BST generated from the data in ascending order is ____________.
Select correct option:
Linear
Nonlinear
Balanced        ok
Un sorted


In a program a reference variable, say x, can be declared as
Select correct option:
int &x ;        ok
int *x ;
int x ;
None of the given options


he depth of a complete binary tree is given by _________
Select correct option:
Dn = n log2n
Dn = n log2n+1
Dn = log2n
Dn = log2(n+1)-1        ok


Suppose there is a BST with elements, 13,3,14,1,4,18 and 2. Now if the method insert(4) is called, which message will be displayed?
Select correct option:
Node is inserted in root
Node is inserted in left subtree        ok
Node is inserted in right subtree
Node already exist in the tree


A binary tree whose every node has either zero or two children is called _________
Select correct option:
Complete binary tree
Binary search tree        ok
Strictly binary tree


Deleting a _____ node in BST is a _______ case
Select correct option:
Root, simplest
Left child, simplest
Right child, simplest

Leaf, simplest