Binary Search Tree (2/5)

Video Details
Youtube Description
Binary Search Trees Part 2: number of possible BSTs for a given set, operations associated with BST: find, findmin

NOTE: remove(key) should remain remove(key) and not removeMin() [I was confused with heaps]
Videos in Current Module