Data Structures and Algorithms MCQs Test 3 Online For Preparation

1. The depth of a complete binary tree is given by ?

2. A binary tree can easily be converted into q 2-tree ?

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

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

5. Identify the data structure which allows deletions at both ends of the list but insertion at only one end ?

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

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

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

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

10. Which of the following data structure is non-linear type ?