[LeetCode] Trim a Binary Search Tree 修剪一棵二叉树
Posted Grandyang
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了[LeetCode] 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
s
以上是关于[LeetCode] Trim a Binary Search Tree 修剪一棵二叉树的主要内容，如果未能解决你的问题，请参考以下文章
[leetcode-669-Trim a Binary Search Tree]
LeetCode 669. Trim a Binary Search Tree
Leetcode 669. Trim a Binary Search Tree
[leetcode]Tree-669. Trim a Binary Search Tree