BST_Successor.md

#BST Successor Search

Given a node n in a binary search tree, explain and code the most efficient way to find the successor of n. Analyze the runtime complexity of your solution.