in doubly linked lists, traversal can be performed
Answers
Answered by
0
Answer:
i really didn't get your question
Explanation:
Could you please explain yourself a bit more from next time onwards.... when u r uploading ur questions... it becomes easy for the people who wanna answer ur questions
Answered by
2
2 ways
Explanation:
- In double linked links, we can travel in 2 ways i.e., from right to left and from left to right.
- Doubly linked list is the type of linked list in which each node contains 3 fields.
- Double linked list node contains 3 fields, they are
- Data field
- Previous node address
- Next node address
- As the node contains next node address, it can travel from left to right.
- Also, the node contains previous node address. So, it can travel from right to left.
- Declaration:
struct node
{
int data;
struct node *left;
struct node *right;
};
Hence, double linked lists can be traversed in two ways.
Similar questions