When comparing List iterators for equality, we only need to compare their Node pointers. Why is it not necessary to compare their List pointers?
Added by Christine B.
Step 1
List iterators are objects that allow us to traverse a linked list. They keep track of the current node we are pointing to and provide methods to move to the next or previous node. Now, let's consider why we only need to compare their Node pointers when comparing Show more…
Show all steps
Your feedback will help us improve your experience
Shelayah Robinson and 87 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Why is a contiguous list considered to be a convenient storage structure for implementing static lists, but not for implementing dynamic lists? Explain your answer.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD