We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Tutorials
  3. Cracking the Coding Interview
  4. Trees: Is This a Binary Search Tree?
  5. Discussions

Trees: Is This a Binary Search Tree?

  • Spiznak + 0 comments

    Python 3 version:

    def checkBST(n, min=0, max=10000):
    if not n:
        return True
    if n.data <= min or n.data >= max:
        return False
    return checkBST(n.left, min, n.data) and checkBST(n.right, n.data, max)

    I have simplified the above "clean" Java solution to make a singular function. It is inline with my initial algorithm, but less than 1/3 of the code (was a conglomorated mish-mosh of extra checks and functions to perform them).