Amazon/Google/Microsoft Phone interview Question | Lowest Common Ancestor of BST | O(log n) Solution

Problem: leetcode.com/p...
Solution: github.com/jeb...
Common phone interview question for Amazon, Google, Microsoft. The time complexity of the solution is O(log n)