Binary Search Tree Validation - Amazon Top Interview Questions


Problem Statement :


Given a binary tree root, return whether it's a binary search tree. A binary tree node is a binary search tree if :

All nodes on its left subtree are smaller than node.val
All nodes on its right subtree are bigger than node.val
All nodes hold the these properties.
Constraint

n ≤ 100,000 where n is the number of nodes in root

Example 1

Input

root = [3, [2, null, null], [9, [7, [4, null, null], [8, null, null]], [12, null, null]]]

Output

True

Example 2

Input

root = [3, [1, null, null], [5, [4, null, [7, null, null]], [6, null, null]]]

Output

False

Explanation

This is not a binary search tree because the 7 is not smaller than 5.



Solution :



title-img




                        Solution in C++ :

bool isBST(Tree* root, int lo, int hi) {
    if (root == NULL) return 1;
    if (root->val < lo or root->val > hi) return 0;

    return isBST(root->left, lo, root->val) and isBST(root->right, root->val, hi);
}

bool solve(Tree* root) {
    return isBST(root, INT_MIN, INT_MAX);
}
                    




                        Solution in Python : 
                            
# class Tree:
#     def __init__(self, val, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def solve(self, root):
        def inorder(root):
            if root is None:
                return True
            nonlocal l
            left = inorder(root.left)
            if (l > root.val) or not left:
                return False
            l = root.val
            return inorder(root.right)

        l = -float("inf")
        return inorder(root)
                    


View More Similar Problems

Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →

Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func

View Solution →

Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →

Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

View Solution →

Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →

Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →