LeetCode 669. 【递归】修建二叉搜索树
原题链接
简单
作者:
大明湖的鱼
,
2021-01-19 20:48:21
,
所有人可见
,
阅读 341
/**
* 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 == nullptr) return 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;
}
};