Pairs violating the BST property.md

Pairs violating the BST property

METHOD 1 (using inorder TLE)

 void inorder(Node* root, vector<int> & ans)
    {
        if(root==NULL)
            return;
            
        inorder(root->left,ans);
        ans.push_back(root->data);
        inorder(root->right,ans);
    }

    int pairsViolatingBST(int n, Node *root) {
    
        vector<int> ans;
        
        inorder(root,ans);
        
        int t=0;
        
        for(int i=0;i<ans.size()-1;i++)
        {
            for(int j=i+1;j<ans.size();j++)
            {
                if(ans[i]>ans[j])
                    t++;
            }
        }
        
        return t;
    }