
1. Which data structure allows deleting data elements from front and inserting at rear?

Stacks

Queues

Deques

Binary search tree

Queues

2. Identify the data structure which allows deletions at both ends of the list but insertion at only one enD

Inputrestricted deque

Outputrestricted deque

Priority queues

None of above

Inputrestricted deque

3. Which of the following data structure is nonlinear type?

Strings

Lists

Stacks

None of above

None of above

4. Which of the following data structure is linear type?

Strings

Lists

Queues

All of above

All of above

5. To represent hierarchical relationship between elements, which data structure is suitable?

Deque

Priority

Tree

All of above

Tree

6. A binary tree whose every node has either zero or two children is called

Complete binary tree

Binary search tree

Extended binary tree

None of above

Extended binary tree

7. The depth of a complete binary tree is given by

Dn = n log2n

Dn = n log2n+1

Dn = log2n

Dn = log2n+1

Dn = log2n+1

8. When representing any algebraic expression E which uses only binary operations in a 2tree

9. A binary tree can easily be converted into q 2tree

10. When converting binary tree into extended binary tree, all the original nodes in binary tree are
Practice Now Data Structure Online Tests