Java simple solution


  • 0
        public TreeNode trimBST(TreeNode root, int L, int R) {
            while (root != null && (root.val < L || root.val > R)) {
                if (root != null && root.val < L) 
                    root = root.right;
                if (root != null && root.val > R)
                    root = root.left;
            }
            
            if (root != null) {
                root.left = trimBST(root.left, L, R);
                root.right = trimBST(root.right, L, R);
            }
            return root;
        }
    
    
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.