CS301 Quiz No.2 Shared by VUTJ

Question # 1 of 10 ( Start time: 05:55:44 PM )  Total Marks:  1 
Leaf node of binary search tree contains ________
Select correct option: 
 One Null pointer
 Three Null pointers
 Two Null pointers
 All of the given



Question # 2 of 10 ( Start time: 05:57:06 PM )  Total Marks:  1 
During deletion of node from BST, if we found this node don’t have in-order successor and predecessor. It means this node is __________.
Select correct option: 
 Left most node in the binary search tree
 Right most node in binary search tree
 Root node
 None of given options   


Question # 3 of 10 ( Start time: 05:58:28 PM )  Total Marks:  1 
If we write functions for recursive and non recursive inorder traversal method of BST, what will be the difference between its functions prototypes?
Select correct option: 
 Different return types
 Different function names
 Different arguments list
 Nothing will be different


Question # 4 of 10 ( Start time: 05:59:48 PM )  Total Marks:  1 
Longest path from root node to farthest leaf node is called ________ of tree
Select correct option: 
 Level
 Length
 Depth
 Node level


Question # 5 of 10 ( Start time: 06:00:39 PM )  Total Marks:  1 
In which of the following functions, the value of variable cannot be changed in function body?
Select correct option: 
 int cube( int num)
 int cube(int& num)
 int cube(const int& num)
 int cube(int* num)


Question # 6of 10 ( Start time: 06:01:44 PM)  Total Marks: 1
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
 None of above 


Question # 7 of 10 ( Start time: 06:03:08 PM )  Total Marks:  1 
In which traversal method, the recursive calls can be used to traverse a binary tree ?
Select correct option: 
 In preorder traversal only 
 In inorder traversal only 
 In postorder traversal only 
 All of the given options


Question # 8 of 10 ( Start time: 06:04:35 PM )  Total Marks:  1 
Deleting a _____ node in BST is a _______ case
Select correct option: 
 Root, simplest
 Left child, simplest
 Right child, simplest
 Leaf, simplest


Question # 9 of 10 ( Start time: 06:06:04 PM )  Total Marks:  1 
A BST generated from the data in ascending order is ____________.
Select correct option: 
 Linear
 Nonlinear
 Balanced
 Un sorted


Question # 10 of 10 ( Start time: 06:07:05 PM )  Total Marks:  1 
Which one is not the property of binary tree?
Select correct option: 
 Every node in binary tree should have maximum two children. 
 Only one node should have two parents. 
 Sibling nodes should have same parent. 
 None of given options.