TAILIEUCHUNG - Lecture note Java methods A & AB: Object-oriented programming and data structures: Chapter 20 - Maria Litvin, Gary Litvin

Chapter 20 - Lists and iterators. In this and the following chapter we start looking at the implementation details of data structures. This chapter’s objectives are to: Learn to work with ListNode objects and do-it-yourself linked lists; understand singly-linked list, linked list with a tail, circular list, and doubly-linked list; learn to implement iterators. | Java Methods A & AB Object-Oriented Programming and Data Structures Maria Litvin ● Gary Litvin Copyright © 2006 by Maria Litvin, Gary Litvin, and Skylight Publishing. All rights reserved. Lists and Iterators 20- In this and the following chapter we start looking at the implementation details of data structures. Objectives: Learn to work with ListNode objects and do-it-yourself linked lists Understand singly-linked list, linked list with a tail, circular list, and doubly-linked list Learn to implement iterators 20- The AP CS course description indicates that students must be familiar with the interface and and LinkedList classes, as well as with manipulating “do-it-yourself” linked lists based on the College Board’s ListNode class. Singly-Linked List Each node holds a reference to the next node In the last node, next is null A linked list is defined by a reference to its first node (often named head or front) value 0 value 1 value 2 value .

• Kỹ thuật lập trình
• Java methods
• Object oriented programming
• Data structures
• Lập trình hướng đối tượng
• Cấu trúc dữ liệu
• Singly linked list
• Java syntax
• Lecture note Java methods
• Java collections framework
• Hardware terms
• Software development
• OO program models
• Describing algorithms
• Data types
• Boolean expressions
• Iterative statements
• Implementing classes
• String class
• Initializing arrays
• ArrayList pitfalls
• Binary search
• Binary files
• Computer graphics
• GUI components
• Mouse events