Leetcode 669. Trim a Binary Search Tree

最新推荐文章于 2025-02-03 15:37:10 发布

weixin_34067980

最新推荐文章于 2025-02-03 15:37:10 发布

阅读量56

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/simplepaul/p/7679092.html

本文介绍了一种算法，用于修剪二叉搜索树，使其所有元素位于给定的最低和最高界限之间。通过递归地调整树的左子树和右子树来实现，确保最终修剪后的树满足条件。

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