[HackerRank][Python3] Binary Search Tree : Lowest Common Ancestor

Problem :

https://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor/problem

My Solution :

#!/usr/bin/env python3


def lca(root, v1, v2):
    if root.info > max(v1, v2):
        return lca(root.left, v1, v2)
    if root.info < min(v1, v2):
        return lca(root.right, v1, v2)
    return root