LeetCode #669 Trim a Binary Search Tree

Posted on | Post modified | In , , , , , , , ,

Problem

Given a binary search tree and the lowest and highest boundaries as Land 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.

Examples

1
2
3
4
5
6
7
8
9
10
11
12
Input: 
    1
   / \
  0   2

  L = 1
  R = 2

Output: 
    1
      \
       2
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
Input: 
    3
   / \
  0   4
   \
    2
   /
  1

  L = 1
  R = 3

Output: 
      3
     / 
   2   
  /
 1

Solution

Method: Recursive

Time Complexity:

Space Complexity:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def trimBST(self, root, L, R):
        """
        :type root: TreeNode
        :type L: int
        :type R: int
        :rtype: TreeNode
        """
        if not root:
            return None
        if root.val < L:
            return self.trimBST(root.right, L, R)
        elif root.val > R:
            return self.trimBST(root.left, L, R)
        else:
            root.right = self.trimBST(root.right, L, R)
            root.left = self.trimBST(root.left, L, R)
        
        return root