Binary Search Tree Implement a Binary Search Tree that supports find, push, pop, print, min, max, mid and can handle duplicates. The tree does not need to balance.