思路:
判断是否小于low,小于low,则将右节点返回给上一层(因为是二叉搜索树,左子节点会小于根节点,所以左子节点不在范围内了,而右子节点可能还是符合留下了的要求。)
同样,大于high的时候也是如此,返回大于high的左子节点。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* trimBST(TreeNode* root, int low, int high) {
if (root == NULL) return NULL;
if(root->val < low){
return trimBST(root->right,low,high);
} else if(root -> val > high){
return trimBST(root -> left,low,high);
} else{
root -> left = trimBST(root->left,low,high);
root -> right = trimBST(root->right,low,high);
return root;
}
return root;
}
};