leecode-669-修剪二叉搜索树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode trimBST(TreeNode root, int low, int high) {
        // base case
        if (root == null) return null;
        // 判断 root 是否在范围内
        if (root.val < low) 
            return trimBST(root.right, low, high);
        if (root.val > high) 
            return trimBST(root.left, low, high);
        // 递归构造左子树
        root.left = trimBST(root.left, low, high);
        // 递归构造右子树
        root.right = trimBST(root.right, low, high);
        return root;
    }
}