Discussion
The type of linked list in which the node does not contain any pointer or reference to the previous node:
Answer: B
Correct answer: Singly linked list
In a singly linked list each node holds one pointer, to its successor. Nothing refers backwards, so traversal runs in one direction only and deleting a node requires a reference to the one before it.
Adding a second pointer to the predecessor gives a doubly linked list, which costs memory per node but allows backward traversal and deletion given only the target node. Whether a list is circular is a separate question, concerning only whether the last node points back to the first.
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