Trim a Binary Search Tree(leetcode)

Trim a Binary Search Tree

---

题目

leetcode题目

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]，满足这个范围的节点留下，其余会被舍弃。
我们根据二叉搜索树的特征：

1. 若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值
2. 若它的右子树不空，则右子树上所有结点的值均大于它的根结点的值

可以进行如下操作：

1. root_node->value < L => 根节点以及对应的左子树可以抛弃，只留下右子树
2. root_node->value > R => 根节点以及对应的右子树可以抛弃，只留下左子树
3. root_node->value >= L && root_node->value <= 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 == NULL) {
            return NULL;
        }
        if (L > root->val) {
            return trimBST(root->right, L, R);
        }
        if (R < root->val) {
            return trimBST(root->left, L, R);
        }
        if (L <= root->val && R >= root->val) {
            root->left = trimBST(root->left, L, R);
            root->right = trimBST(root->right, L, R);
            return root;
        }
    }
};