Data Structures MCQ Quiz - Multiple Choice Questions & Answers Page 2

11. In singly linked list each node contains a value and a link to its

1. Successor
2. Predecessor
3. Both A & B
4. None of this

12. Singly Linked list go ....................

1. Forward
2. Backward
3. Both A & B
4. None of this

13. All the nodes in a linked list must have the same structure

1. 1
2. Unpredictable
3. None of this

14. Last node references to in a linked list

1. Head
2. Null
3. Pointer value
4. None of this

15. To represent a node we use which data type

1. enum
2. struct
3. int
4. float

16. Doubly linked list can be traversed in

1. Forward
2. Backward
3. Both A & B
4. None of this

17. Doubly linked list requires .................... space as compared with singly linked list

1. More
2. less
3. equal
4. None of this

18. In circular linked list node hold NULL value

1. 1
2. May be
3. None of this

19. .................... the linked list means we can visit all the nodes of the list starting with the node pointed by head

1. Insertion
2. Deletion
3. Traversing
4. Searching

20. Internal node are also called as .................... node

1. Terminal
2. Child
3. Root
4. Branch