This is my implementation of the Binary Search Tree. It provides all necessary API calls for search, insert, delete, finding min, max, inorder successor and predecessor in a BST.