updated bounty big ones +20%

README.md

@@ -27,17 +27,17 @@ BOUNTY:
 
 * implement UnrolledSinglyLinkedList, UnrolledDoubleLinkedList +1200 each
 * implement VList +1600
-* implement Skiplist +2400
+* implement Skiplist +3600
 * implement HashFunction +300 each
-* implement ChainingHashtable +1200 for each type (Linked Bucket, BST Bucket, Array Bucket)
+* implement ChainingHashtable +1500 for each type (Linked Bucket, BST Bucket, Array Bucket)
 * implement ClosedHashtable +1200 for each CollisionFunction
 * implement ArrayHash +1500 for string value
 * implement HashArrayTree +1200
 * implement ArrayBinaryTree, LinkBinaryTree, ArrayBST +1800 each (with BFS printing)
-* implement AVLTree +2500, RBTree +3000, SplayTree +2000, ArrayAVL, ArrayRB, ArraySplay +3600
-* implement SliceHeap +800, BSTHeap +600
-* implement Trie +1200, CompressedTrie +3200, BurstTrie +4800, HATTrie +6000
+* implement AVLTree +2500, RBTree +3000, SplayTree +2000, ArrayAVL, ArrayRB, ArraySplay +4000
+* implement SliceHeap +900, BSTHeap +600
+* implement Trie +3500, CompressedTrie +5500, BurstTrie +8000, HATTrie +12500
 * implement QuickSort +1500, HeapSort +500, Non-recursive Inplace MergeSort +1500, CombSort +800, etc, that allow Less interface
 * implement BinarySearch, JumpSearch, InterpolationSearch +400 that Allow Less, Equal interface
-* implement R-Tree +3000, k-d Tree +2000
+* implement R-Tree +5000, k-d Tree +8000 (using reflection)
 * implement any other data structure or algorithm (bounty may vary, contact me for details)