Luis Felipe Zaguini

Implement [Heaps](https://www.geeksforgeeks.org/binary-heap/)

Implement [Tries](https://www.geeksforgeeks.org/trie-insert-and-search/)

Implement [Graphs](https://www.geeksforgeeks.org/graph-data-structure-and-algorithms/)

Implement [Doubly Linked Lists](https://www.geeksforgeeks.org/doubly-linked-list/)

Implement [Merge Sort](https://www.geeksforgeeks.org/merge-sort/) [Follow this pattern](https://github.com/zaguiini/use-data-structures/pull/20)

Implement [Quick Sort](https://www.geeksforgeeks.org/quick-sort/) [Follow this pattern](https://github.com/zaguiini/use-data-structures/pull/20)

Implement [Heap Sort](https://www.geeksforgeeks.org/heap-sort/) This depends on #12 [Follow this pattern](https://github.com/zaguiini/use-data-structures/pull/20)

Implement [Counting Sort](https://www.geeksforgeeks.org/counting-sort/) [Follow this pattern](https://github.com/zaguiini/use-data-structures/pull/20)

Implement [Radix Sort](https://www.geeksforgeeks.org/radix-sort/) [Follow this pattern](https://github.com/zaguiini/use-data-structures/pull/20)

Implement [Bucket Sort](https://www.geeksforgeeks.org/bucket-sort-2/) [Follow this pattern](https://github.com/zaguiini/use-data-structures/pull/20)