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
-
ArrayDequeSimple
-
LinkedDequeSimple
-
ArrayPriorityQueueSimple
-
MergingPeekingIncreasingIterator + IntegerIncreasingSequencePeekingIterator
7.5 point on every task = 15
-
ArrayDequeFull
-
LinkedDequeFull
5 point on every task = 25
-
AVLTree
-
AVLTreeIterable
-
RedBlackTree: add
-
RedBlackTree: add + remove
-
OpenHashTable + Student
+1 point for every iterator with remove in ... = 5
- ArrayDequeSimple
- LinkedDequeSimple
- ArrayPriorityQueueSimple
- AVLTreeIterable (ascending + descending)
- OpenHashTable
max points = 55