Which term refers to a linked list where each node has pointers to both the next and previous nodes?
Difficulty: Medium
About this MCQ
This Medium Data Structures MCQ checks one syllabus fact.
The question is: “Which term refers to a linked list where each node has pointers to both the next and previous nodes?”
The accepted answer is C. Doubly linked list. Doubly linked list refers to a linked list where each node has pointers to both the next and previous nodes.
- A. Graph
Why not A: “Graph” is not correct. The accepted answer is C. Doubly linked list. Doubly linked list refers to a linked list where each node has pointers to both the next and previous nodes.
- B. Binary search tree
Why not B: “Binary search tree” is not correct. The accepted answer is C. Doubly linked list. Doubly linked list refers to a linked list where each node has pointers to both the next and previous nodes.
- C. Doubly linked list ✓
- D. Linked list
Why not D: “Linked list” is not correct. The accepted answer is C. Doubly linked list. Doubly linked list refers to a linked list where each node has pointers to both the next and previous nodes.
Correct answer
C. Doubly linked list
Explanation
Doubly linked list refers to a linked list where each node has pointers to both the next and previous nodes.
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- The concept in which an abstract data structure where each element has a priority, and elements are served acc...
- Identify the correct definition of Priority queue.
- What term describes the following? a data structure that allows insertion and removal of elements from both th...
- In computer science, Dequeue refers to which of the following?
- Select the correct name for: a matrix in which most of the elements are zero, often stored using specialized s...
- Which statement correctly explains Sparse matrix?