Memory is not a constraint. In a single iteration(NOTE: you
can't go back), how will you find out the 10th last
node/item in a linked list.
Answer Posted / ranjani
The approach is to have 2 ptrs ,ptr1 and ptr2.Where ptr1
would start at the first node of the linked list and ptr2
would be at the kth position from ptr1.In this case k=10.
From there on until ptr2->next!=null keep moving ptr1 and
ptr2 by one each.When ptr2 reached the last element of the
linked list.Ptr1 would be pointing to the 10th (kth) last
element.
Example:
1->2->3->4->5->6->7->8->9->10->11->12. In this case 10th
last element would be 3.
Start with ptr1 at node 1 and ptr2 at node 10.
Now till ptr2->next!=null ptr1=ptr1->next and ptr2=ptr2->next.
This way when ptr2 reaches 12 ptr1 would be at 3,which is
the 10th last element.
| Is This Answer Correct ? | 8 Yes | 0 No |
Post New Answer View All Answers
Can we specify variable field width in a scanf() format string? If possible how?
Do you know the use of vtable?
Can char be a number c++?
What is scope operator in c++?
Define linked lists with the help of an example.
What are built-in functions? What is the syntax for the definition?
What is meant by const_cast?
Can we sort map in c++?
Explain data encapsulation?
What is Destructor in C++?
Explain the static storage classes in c++.
Write about the retrieval of n number of objects during the process of delete[]p?
What are put and get pointers?
What is the difference between a declaration and a definition?
What is near, far and huge pointers? How many bytes are occupied by them?