Question # 1 of 10 ( Start time: 06:53:05 PM ) Total Marks: 1
Which data structure allows deleting data elements from front and inserting at rear?
Select correct option:
Stacks
Queues ok
Deques
Binary search tree
Question # 2 of 10 ( Start time: 06:53:42 PM ) Total Marks: 1
To represent hierarchical relationship between elements, which data structure is suitable?
Select correct option:
Dequeue
Priority
Stack
Tree ok
Question # 3 of 10 ( Start time: 06:54:16 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 ok
None of above
Question # 4 of 10 ( Start time: 06:54:38 PM ) Total Marks: 1
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
Question # 5 of 10 ( Start time: 06:55:04 PM ) Total Marks: 1
When converting binary tree into extended binary tree, all the original nodes in binary tree are ____
Select correct option:
Internal nodes on extended tree
External nodes on extended tree ok?
Vanished on extended tree
None of above
Question # 6 of 10 ( Start time: 06:55:55 PM ) Total Marks: 1
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
None of above
Question # 7 of 10 ( Start time: 06:56:17 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 # 8 of 10 ( Start time: 06:56:50 PM ) Total Marks: 1
A BST generated from the data in ascending order is ____________.
Select correct option:
Linear
Nonlinear
Balanced ok
Un sorted
Question # 9 of 10 ( Start time: 06:57:16 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 # 10 of 10 ( Start time: 06:57:56 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. ok
Sibling nodes should have same parent.
None of given options.
