KwickClips Java · 43 sec · free
How do you visit every node without an index?
Short answer. Use a helper pointer that moves from start to null.
Why must start not move?
Because then you lose the way back to the first node.
Remember
| Use a helper p |
| Stop when p is null |
| Never move start |
A linked list has no index. So how do we visit every node? Start p at start. Print p dot data. Move p to p dot next. Stop at null. Remember. Use a helper p. Stop when p is null. Never move start.
This clip is from the full lesson: Linked Lists — 6 minutes, with the tables, the quick answers and the whole lesson in text.
Useful for: ISC Class 12 Computer Science (868), Programming All levels Java
More KwickClips from this lesson
What does a node hold?43 sec
Why did my whole list vanish?41 sec
Which gives faster access to item k?43 secDisclaimer. KwickAcademy is free study material for general learning and revision. Parts of it, including the voice-over, are produced with the help of AI tools and may contain errors; if you spot one, please tell us and we will correct it. Syllabus, marks and exam details follow the latest official board publications available to us, and boards can change them at any time, so always confirm against your board's official website and your school. Using this material does not guarantee any marks or result. Board names and trademarks belong to their owners; Kwickprep is not affiliated with or endorsed by any examination board. We never ask for passwords, OTPs or ID numbers. Your progress is saved only in this browser. Full disclaimer · Privacy