Explain the most efficient method to reverse a linked list?
- 1 Answers
- 954 Views
- I also Faced
- E-Mail Answers
Answer Posted / Jay Prakash Verma
The most common and efficient method is recursion. Start with the last node, traverse backwards, and update the next pointer of each node to point to its successor.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Write a program for Sorting an Array. Which sorting will you prefer?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What sort of serious problems have you experienced, and how have you handled them?
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.
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Can you declare an array without assigning the size of an array?
