Discussion
The type of linked list in which the node does not contain any pointer or reference to the previous node is _____________
Answer: B
Correct answer: Singly linked list
A singly linked list gives each node one pointer, to the next node only. There is no way back, so traversal is forward from the head and a node cannot be deleted without a reference to its predecessor.
A doubly linked list adds a pointer to the previous node, which costs memory but allows backward traversal and deletion given only the node itself. The circular variants differ in whether the last node points back to the first, which is independent of how many pointers each node carries.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development