AaDS

Homework for Algorithms and Data structures on Java for students Technopolis in Peter the Great St.Petersburg Polytechnic University.

---

2.5 point on every task = 10

1. ArrayDequeSimple

2. LinkedDequeSimple

3. ArrayPriorityQueueSimple

4. MergingPeekingIncreasingIterator + IntegerIncreasingSequencePeekingIterator

7.5 point on every task = 15

5. ArrayDequeFull

6. LinkedDequeFull

5 point on every task = 25

7. AVLTree

8. AVLTreeIterable

9. RedBlackTree: add

10. RedBlackTree: add + remove

11. OpenHashTable + Student

+1 point for every iterator with remove in ... = 5

• ArrayDequeSimple
• LinkedDequeSimple
• ArrayPriorityQueueSimple
• AVLTreeIterable (ascending + descending)
• OpenHashTable

max points = 55