O(n) Java Recursion


  • 0
    H

    public TreeNode trimBST(TreeNode root, int L, int R) {

                   if(root == null)
    			 return root;
    		 
    		 root.left = trimBST(root.left, L, R);
    		 root.right = trimBST(root.right, L, R);
    		 
    		 if(root.val < L){
    			 return root.right;
    		 }
    		 if(root.val > R){
    			 return root.left;
    		 }
    		 return root;
      }

Log in to reply
 

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