InterviewSolution
Saved Bookmarks
| 1. |
The type of linked list in which the node does not contain any pointer or reference to the previous node is _____________(a) Circularly singly linked list(b) Singly linked list(c) Circular doubly linked list(d) Doubly linked listI have been asked this question in an interview.The doubt is from Static vs Dynamic Memory Allocation in chapter Dynamic Memory Allocation in C of C |
|
Answer» RIGHT choice is (b) Singly LINKED list The BEST I can explain: A singly linked list is one in which each node has two fields, namely DATA field and pointer field. Data field stores the data and the pointer field points to the address of the next node. |
|