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

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure (DS)

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

(A) singly linked list
(B) circular linked list
(C) doubly linked list
(D) linear linked list

💬 Discuss

✅ Correct Answer: (C) doubly linked list

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

90

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate