How Do You Find Out If A Linked-list Has An End? (i.e. The List Is No

1.	How Do You Find Out If A Linked-list Has An End? (i.e. The List Is Not A Cycle)
Answer» You can FIND out by using 2 POINTERS. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a CYCLE, the one that goes 2 nodes each time will EVENTUALLY meet the one that goes slower. If that is the case, then you will know the linked-list is a cycle. You can find out by using 2 pointers. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a cycle, the one that goes 2 nodes each time will eventually meet the one that goes slower. If that is the case, then you will know the linked-list is a cycle.

How Do You Find Out If A Linked-list Has An End? (i.e. The List Is Not A Cycle)

Answer»

You can FIND out by using 2 POINTERS. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a CYCLE, the one that goes 2 nodes each time will EVENTUALLY meet the one that goes slower. If that is the case, then you will know the linked-list is a cycle.

You can find out by using 2 pointers. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a cycle, the one that goes 2 nodes each time will eventually meet the one that goes slower. If that is the case, then you will know the linked-list is a cycle.

Discussion

No Comment Found

Related InterviewSolutions

Write A Code Snippet To Display An Integer In A Binary Format?
Explain The Concept Of Dynamic Allocation Of Memory?
Write About The Local Class And Mention Its Use?
Write About A Nested Class And Mention Its Use?
Define Pure Virtual Function?
How Does List R; Differs From List R();?
Explain How Would You Handle A Situation Where You Cannot Call The Destructor Of A Local Explicitly?
What Is The Sequence Of Destruction Of Local Objects?
Define A Conversion Constructor?
Is It Possible To Pass An Object Of The Same Class In Place Of Object Reference To The Copy Constructor?