代码随想录 Leetcode669. 修剪二叉搜索树

题目：

---

代码(首刷看解析 2024年1月31日）：

class Solution {
public:TreeNode* trimBST(TreeNode* root, int low, int high) {if (!root) return root;if (root->val < low) {TreeNode* node = trimBST(root->right,low,high);return node;}if (root->val > high) {TreeNode* node = trimBST(root->left,low,high);return node;}root->left = trimBST(root->left, low, high);root->right = trimBST(root->right, low, high);return root;}
};