A doubly linked list has -pointers with each node?
Answers
Answered by
0
it may be 2 one pointing to the previous node and one pointing to the next node.. so for 5 nodes that would make 10 pointers
Answered by
0
Answer:
three parts
Therefore, in a doubly linked list, a node consists of three parts: node data, pointer to the next node in sequence (next pointer) , pointer to the previous node (previous pointer).
Similar questions