1

A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

Correct Answer: doubly linked list

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Data Structure (DS) MCQ: A linear list in which each node has pointers to point to the predecessor and successors nodes is called as .. | Extra Education