Question # 1 of 10 ( Start time: 07:06:22 PM ) Total Marks: 1
Sub-tree of binary search tree should be ________.
Select correct option:
Binary tree
Binary search tree ok
Complete binary tree
None of given options
Question # 2 of 10 ( Start time: 07:06:47 PM ) Total Marks: 1
Leaf node of binary search tree contains ________
Select correct option:
One Null pointer ok
Three Null pointers
Two Null pointers
All of the given
Question # 3 of 10 ( Start time: 07:07:42 PM ) Total Marks: 1
Which of the following data structure is linear type?
Select correct option:
Stack
List
Queue
All of above ok
Question # 4 of 10 ( Start time: 07:08:01 PM ) Total Marks: 1
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
Question # 5 of 10 ( Start time: 07:08:12 PM ) Total Marks: 1
The depth of a binary tree is
Select correct option:
Total number of nodes in the tree
Number of leaf nodes in the tree
Number of non-leaf nodes in the tree
Maximum level of a leaf ok
Question # 6 of 10 ( Start time: 07:08:47 PM ) Total Marks: 1
The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
Select correct option:
ABFCDE
ADBFEC ok
ABDECF
ABDCEF
Question # 7 of 10 ( Start time: 07:09:45 PM ) Total Marks: 1
A tree is an AVL tree if
Select correct option:
Any one node fulfills the AVL condition
At least half of the nodes fulfill the AVL condition
All the nodes fulfill the AVL condition
None of the given options
Question # 8 of 10 ( Start time: 07:10:03 PM ) Total Marks: 1
The smallest value element in a binary tree( Each node with left and right pointers)lies at
Select correct option:
Root Node
Left Child of Root ok
Right Most Node
Left Most Node
Question # 9 of 10 ( Start time: 07:10:34 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 ok
Question # 10 of 10 ( Start time: 07:10:51 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 ok
Right most node in binary search tree
Root node
None of given options
