Trim a Binary Search Tree

最新推荐文章于 2021-02-27 13:36:10 发布

张荣华_csdn

最新推荐文章于 2021-02-27 13:36:10 发布

阅读量207

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/zrh_CSDN/article/details/80850333

leetcode 同时被 3 个专栏收录

211 篇文章

订阅专栏

树

93 篇文章

订阅专栏

递归

36 篇文章

订阅专栏

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

/**
* 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)
return NULL;
if(root->val<L)
return trimBST(root->right,L,R);
else if(root->val>R)
return trimBST(root->left,L,R);
else
{
root->left=trimBST(root->left,L,R);
root->right=trimBST(root->right,L,R);
return root;
}
}
};