LeetCode--Trim a Binary Search Tree

思路:

    前序遍历整个树,对于不在阈值里的节点,直接跳到其左子节点或右子节点.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode trimBST(TreeNode root, int L, int R) {
        if(root==null){
            return root;
        }
        
        if(root.val<L){
            return trimBST(root.right,L,R);
        }
        
        if(root.val>R){
            return trimBST(root.left,L,R);
        }
        
        root.left=trimBST(root.left,L,R);
        root.right=trimBST(root.right,L,R);
        
        return root;
    }   
}