@@ -20,30 +20,30 @@ This is an incomplete list of arguments in favor of immutability:
2020
2121
2222##Currently Supported Data Structures
23- - [ Queue] ( https://en.wikipedia.org/wiki/Queue_(abstract_data_type) )
24- - [ Stack] ( https://en.wikipedia.org/wiki/Stack_(abstract_data_type) )
25- - [ List] ( https://en.wikipedia.org/wiki/List_(abstract_data_type) )
26- - < b > [ Dictionary (Associative Array)] ( https://en.wikipedia.org/wiki/Associative_array ) </ b >
27- - < b > [ Set] ( https://en.wikipedia.org/wiki/Set_(abstract_data_type) ) </ b >
28- - < b > [ BinaryTree] ( https://en.wikipedia.org/wiki/Binary_tree ) </ b >
29- - < b > [ Heap] ( https://en.wikipedia.org/wiki/Heap_(data_structure) ) </ b >
23+ - [ Queue] ( https://github.com/d-kiss/candyland/blob/master/abstract/queue.py )
24+ - [ Stack] ( https://github.com/d-kiss/candyland/blob/master/abstract/stack.py )
25+ - [ List] ( https://github.com/d-kiss/candyland/blob/master/abstract/list.py )
26+ - [ Dictionary (Associative Array)] ( https://github.com/d-kiss/candyland/blob/master/abstract/dictionary.py )
27+ - [ Set] ( https://github.com/d-kiss/candyland/blob/master/abstract/set.py )
28+ - [ BinaryTree] ( https://github.com/d-kiss/candyland/blob/master/trees/binary_tree.py )
29+ - [ Heap] ( https://github.com/d-kiss/candyland/blob/master/trees/heap.py )
3030
3131##Upcoming:
32- 1 . <strike > Queue </strike >
33- 2 . <strike > Stack </strike >
34- 3 . <strike > List </strike >
32+ 1 . <strike >[ Queue] ( https://en.wikipedia.org/wiki/Queue_(abstract_data_type) ) strike >
33+ 2 . <strike >[ Stack] ( https://en.wikipedia.org/wiki/Stack_(abstract_data_type) ) </strike >
34+ 3 . <strike >[ List] ( https://en.wikipedia.org/wiki/List_(abstract_data_type) ) </strike >
35354 . <strike >KeyValuePair</strike > (Who needs a key-value pair in python? ;))
36- 5 . <strike >Set</strike >
36+ 5 . <strike >[ Set] ( https://en.wikipedia.org/wiki/Set_(abstract_data_type) ) </strike >
37376 . PriorityQueue
38387 . LinkedList
39398 . SortedList
40409 . AVLTree
414110 . BinarySearchTree
424211 . RedBlackTree
43- 12 . <strike >Heap</strike >
43+ 12 . <strike >[ Heap] ( https://en.wikipedia.org/wiki/Heap_(data_structure) ) </strike >
444413 . HashTable
45- 14 . <strike >Dictionary (Associative Array )</strike >
46- 15 . <strike >BinaryTree</strike >
45+ 14 . <strike >[ Dictionary] ( https://en.wikipedia.org/wiki/Associative_array ) </strike >
46+ 15 . <strike >[ BinaryTree] ( https://en.wikipedia.org/wiki/Binary_tree ) </strike >
4747
4848* For suggestion you can[ mail] ( mailto:speakupness@gmail.com ) us
4949* Suggestions taken from[ Wikipedia's Data Structures] ( https://en.wikipedia.org/wiki/List_of_data_structures )