Skip to main content

Validate Binary Search Tree | Leetcode(easy solution)

Introduction:
In this tutorial we will try to solve this question from leetcode. and this is also an important question for coding interview. so let's see this problem and try to solve it.

Problem Statement:

We have given a Binary Tree. and then we have to find out whether it is also Binary Search Tree or Not?
I hope you understand the difference between Binary Tree and Binary Search Tree.


Solution:
There are many ways to solve this problem, but we will see the most easy and efficient way.
So if you know about different kind of traversal(Inorder, Preorder and Postorder) of Binary Tree, then you can easily solve this problem.

To solve this problem, we will use Inorder traversal. In Inorder traversal we first traverse the left part then root and then right part of the tree.

Trick: Inorder traversal of Binary Search Tree will be in sorted order. it means, if we find the Inorder traversal of any Binary Search Tree, then it will be in sorted order.

so we will use this trick to solve this problem. first of all we will find the Inorder traversal of given Binary Tree and then check either it is in sorted order or not. if it is in sorted order then the given BT will be BST also, otherwise not.

Image:




Full Code:

  void inorder(TreeNode *root,vector<int>&v){
        if(root==NULL)
            return;
        inorder(root->left,v);
        v.push_back(root->val);
        inorder(root->right,v);
    }
    bool isValidBST(TreeNode* root) {
        if(root==NULL)
            return true;
  
        vector<int>v;
        inorder(root,v);
        if(v.size()==1){
            return true;
        }
        int flag=0;
     for(int i=0;i<v.size()-1;i++){
         if(v[i]>=v[i+1]){
             flag=1;
             break;
         }
     }
        if(flag==1){
            return false;
        }
        else{
            return true;
        }
    }

so basically what i am doing in my code is, i am traversing the given Binary Tree using Inorder traversal and then putting it into a vector. then checking that the vector is sorted or not using a for loop. if vector is sorted then i am returning True, otherwise return False.

if you have any query, comment it in comment section. i will try to solve your query.
best of luck.

Comments

Post a Comment

Popular posts from this blog

Construct Binary Tree from preorder and inorder | Data Structure

Introduction: In this tutorial we are going to see how we can construct the binary tree from given preorder and inorder. Prerequisites: you should know about binary tree traversal and on paper you can draw binary tree from given preorder and inorder traversal. Inorder:left->root->right; Preorder:root->left->right; Problem Statement: we have given two arrays. one for preorder and another for inorder. by using these two array we have to built a binary tree. eg: preorder = [3,9,20,15,7] inorder = [9,3,15,20,7] solution: Solution: We will follow recursive approach to solve this question.let's discuss how we can solve it. Trick: In the given preorder the very first element will be the root of the tree. then we will find root element in inorder also. and we know in inorder traversal we have left part then root and then right part of the tree. by using preorder we can get the root of the main tree and by using inorder and root we can get the left part and right part of the...
Post a Comment
Read more

Symmetric Tree | Interview Problem

Introduction: In this tutorial we are going to solve a good question which will clear your doubts on how BFS or level order traversal is useful to solve binary tree problems. this is basically a question from Leetcode, and it is really very good problem to practice BFS. Problem Statement: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: But the following [1,2,2,null,3,null,3] is not: Link : Leetcode Link please make binary tree on paper by the given array above. and you will get a clear picture of the problem. what we are going to do in this problem. Solution: As we know we are going to apply BFS to solve this problem. actually you have to just get one thing to solve this problem. we will perform BFS, but with little change or modification. So first we will store the root->val in a vector or array of the left subtree. and during this we will first insert left child and then ...
Post a Comment
Read more

Linked List Data Structure | Creation and Traversal

Introduction: In this tutorial we will create our linked list. Before writing code let's understand key words related to linked list: 1. Head:    first node of the linked list is called the head of the list. and this node is most important. 2.Tail:       last node is called the tail of the list which must points to  null.            step1: For creating the list first of all let's declare the structure of Nodes of the list: struct Node{ int val; struct Node *next; } step2: write main function: int main(){     int n;     cout<<"enter the number of Nodes:";     cin>>n;     struct Node* head = NULL;     struct Node* temp;     int m;     while(n--){         cout<<"enter the data into nodes:";         cin>>m;    ...
1 comment
Read more