data structures & algorithms set 1 Detailed Explanation And More Example

Question : 1

This data structure allows deletions at both ends of the list but insertion at only one end.

a) Input-restricted deque

b) Output-restricted deque

c) Priority queues

d) None of the above

Question : 2

Each array declaration need not give, implicitly or explicitly, the information about the

a) name of array

b) data type of array

c) first data from the set to be stored

d) index set of the array

Question : 3

The operation of processing each element in the list is known as

a) Merging

b) Inserting

c) Traversal

d) All the above

Question : 4

When converting binary tree into extended binary tree, all the original nodes in binary tree are

a) internal nodes on extended tree

b) external nodes on extended tree

c) vanished on extended tree

d) None of the above