Question

Flipkart | SDE | Coding OA Questions and Solutions | Set - 10

Answer 1

Given a BST and two integers L and R. You have to remove all the nodes from BST whose value lies in [L, R] without using extra space and the properties of BST will remain holds.

Comments

TreeNode* trimBST(TreeNode* root, int l, int r) {        
    if(root==NULL)
        return NULL;
    
    if(root->val>=l && root->val<=r){
        root->left=trimBST(root->left, l,r);
        root->right=trimBST(root->right, l,r);
        return root;
    }else if(root->val <l){
        return trimBST(root->right, l,r);
    }else
        return trimBST(root->left, l,r);  
}