Github Repository


A visualization of an unbalanced binary search tree, with a time complexity of O(n) where n is number of nodes. Insertions and deletions are random, and hibbard deletion is used to delete elements.