LRU implementation

halfway through LRU implementation

BST implementation of MinHeap that holds ints

depth first search on bst

compare two binary trees

breadth first search

bugfix: queue segfaulted if it only had one item

binary trees and depth first searching

update README.md

added quicksort

fixed my BubbleSort. Think I had accidentally done QuickSort for it

recursion

stack implementation and composition for types instead of type aliasing

queue implementation, refactored CustomErrs to be more generic

implemented RemoveAt() on LinkedList, changed custom errors to struct instead of map, and fixed length bug in removal ops