Given a binary search tree and the lowest and highest boundaries as L
and R
, trim the tree so that all its elements lies in [L, R]
(R >= L). You might need to change the root of the tree, so the result should return the new root of the trimmed binary search tree.
Example 1:
Input: 1 / \ 0 2 L = 1 R = 2 Output: 1 \ 2
Example 2:
Input: 3 / \ 0 4 \ 2 / 1 L = 1 R = 3 Output: 3 / 2 / 1
此题明显是使用递归调用的方式来做处理。
核心是判断条件,对于不符合LR边界的值怎么处理,由于是二叉搜索树,因此左右子树都被中间的值分割,意味着若小于L的节点可以直接把子树的右边接到上一级树上。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* trimBST(TreeNode* root, int L, int R) {
if(root!=NULL){
if(root->val<L){
return trimBST(root->right,L,R);
}
if(root->val>R){
return trimBST(root->left,L,R);
}
if(!(root->val<L||root->val>R)){
root->left = trimBST(root->left,L,R);
root->right = trimBST(root->right,L,R);
}
}
return root;
}
};
还有释放内存版:
TreeNode* trimBST(TreeNode* root, int L, int R, bool top=true) {
if (!root)
return root;
root->left = trimBST(root->left, L, R, false);
root->right = trimBST(root->right, L, R, false);
if (root->val >= L && root->val <= R)
return root;
auto result = root->val < L ? root->right : root->left;
if (!top)
delete root;
return result;
}