21. A tree such that each node has at most two child nodes are called as .................... tree

- Binary
- Binary Search
- Full Binary
- Strictly Binary

22. A tree such that each node has exactly two child nodes or no nodes is called as .................... tree

- Binary
- Binary Search
- Full Binary
- Strictly Binary

23. A tree such that each node has exactly two child nodes and all leaf nodes are at the same level is called as .................... tree

- Binary
- Binary Search
- Full Binary
- Strictly Binary

24. In circular link list the link field of the last node points to

- NULL
- First node
- next element location
- itself

25. The linked list data structure usage offers saving in

- time
- space
- both time & space
- none

26. Visiting the root node first is called

- inorder traversal
- preorder traversal
- postorder traversal
- none

27. Visiting the root node last is called

- inorder traversal
- preorder traversal
- postorder traversal
- none

28. Visiting the root node just before visiting the right subtree is called

- inorder traversal
- preorder traversal
- postorder traversal
- none

29. Insertion and deletion of a node in the linked list can be done

- at the beginning
- at the end
- any where in the linked list
- not possible at all

30. An ordered collection of data items is called

- list
- sequential list
- linked list
- none

MCQ Multiple Choice Questions and Answers on Data Structures

Data Structures Question and Answer