[leetcode] 669. Trim a Binary Search Tree

Description

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

分析

题目的意思是：裁剪一颗二叉搜索树，使得二叉树的每个值的最小边界是L，最大边界是R。

• 二叉树首先是递归，递归的终止条件是节点为空，如果当前值小于L，则把左分支裁剪掉，返回右分支并递归；如果当前值大于R，则把右分支裁剪掉，返回左分支并且递归。否则，分别向左右分支递归，返回当前的节点。

代码

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

参考文献

[LeetCode] Trim a Binary Search Tree 修剪一棵二叉搜索树