two-dimensional arrays
• linked lists, including singly, doubly, and circular
• trees, including binary trees
• heaps (and their standard array implementation)
• hash tables
Students should be able to implement the abstract data types with appropriate
data structures.
In addition, many implementations of abstract data types are given as part of the
Java libraries. Those that students are required to understand are specified in the
AP Java subsets for the A and AB courses. These include ArrayList for the A
course and the following for the AB course:
• List interface
• LinkedList
• Set interface
• HashSet
• TreeSet
• Map interface
• HashMap
• TreeMap
• Iterator interface
• ListIterator interface
• Queue interface
• Stack
• PriorityQueue