https://leetcode.com/problems/trim-a-binary-search-tree/
Given the root
of a binary search tree and the lowest and highest boundaries as low
and high
, trim the tree so that all its elements lies in [low, high]
. 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: root = [1,0,2], low = 1, high = 2
Output: [1,null,2]
Example 2:
Input: root = [3,0,4,null,2,null,null,1], low = 1, high = 3
Output: [3,2,null,1]
Example 3:
Input: root = [1], low = 1, high = 2
Output: [1]
Example 4:
Input: root = [1,null,2], low = 1, high = 3
Output: [1,null,2]
Example 5:
Input: root = [1,null,2], low = 2, high = 4
Output: [2]
Constraints:
- The number of nodes in the tree in the range
[1, 104]
. 0 <= Node.val <= 104
- The value of each node in the tree is unique.
root
is guaranteed to be a valid binary search tree.0 <= l <= r <= 104
/**
* 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) {
return helper(root, low, high);
}
private:
TreeNode* helper(TreeNode* node, const int& low, const int& high) {
if (node == nullptr) return nullptr;
if (node->val < low) return helper(node->right, low, high);
if (node->val > high) return helper(node->left, low, high);
node->left = helper(node->left, low, high);
node->right = helper(node->right, low, high);
return node;
}
};