[leetcode]Tree-669. Trim a Binary Search Tree

Posted chenhan05

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[leetcode]Tree-669. Trim a Binary Search Tree相关的知识,希望对你有一定的参考价值。

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
class Solution {  
public:  
    TreeNode* trimBST(TreeNode* root, int L, int R) {  
        if (root == nullptr)  
            return 0;  
        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;  
        }  
    }  
};  

 

以上是关于[leetcode]Tree-669. Trim a Binary Search Tree的主要内容,如果未能解决你的问题,请参考以下文章

669. Trim a Binary Search Tree669.修剪二进制搜索树

LeetCode - Trim a Binary Search Tree

leetcode算法:Trim a Binar Search Tree

[LeetCode] Trim a Binary Search Tree

[leetcode-669-Trim a Binary Search Tree]

LeetCode 669. Trim a Binary Search Tree