This is part 1 of a series of videos related to text and image compression. This first video examines Binary Search Trees. Binary Search Trees are the data structure used in the Huffman Algorithm which we will examine in a future video. In this video I discuss what Binary Search Trees are they and how they work. Code is provided below in the Java programming language.
BinarySearchTree class: https://gist.github.com/mrmemmo/a738e2f8781cf9776a33eab862cd03ad
Runner Class: https://gist.github.com/mrmemmo/b1e96c08437eb681268e21c3c72f3926
