How to traverse data in a linked list in forward and backward direction, write the algorithm?
- 1 Answers
- 1011 Views
- I also Faced
- E-Mail Answers
Answer Posted / Bhagat Singh
To traverse a LinkedList in forward direction:
1. Get the head of the list (first node).
2. Until the current node is not null, move to the next node by accessing its 'next' reference.
3. Print or perform an operation on each node as you visit it.
To traverse a LinkedList in backward direction:
1. Get the last node of the list (last node is the one with null 'next' reference).
2. Until the current node is not the head, move to the previous node by accessing its 'previous' reference (if available) or the current node's 'next' reference (if 'previous' is not available).
3. Print or perform an operation on each node as you visit it.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
Can you declare an array without assigning the size of an array?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Write a program for Sorting an Array. Which sorting will you prefer?
What sort of serious problems have you experienced, and how have you handled them?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
