Trim a Binary Search Tree
Posted Just DO IT by luckygxf
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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
1 public TreeNode trimBST(TreeNode root, int L, int R) { 2 if(root == null){ 3 return null; 4 }else if(root.val >= L && root.val <= R){ 5 root.left = trimBST(root.left, L, R); 6 root.right = trimBST(root.right, L, R); 7 return root; 8 }else if(root.val < L){ 9 return trimBST(root.right, L, R); 10 }else if(root.val > R){ 11 return trimBST(root.left, L, R); 12 } 13 return null; 14 }
以上是关于Trim a Binary Search Tree的主要内容,如果未能解决你的问题,请参考以下文章
669. Trim a Binary Search Tree
[leetcode]Tree-669. Trim a Binary Search Tree
LeetCode - Trim a Binary Search Tree
669. Trim a Binary Search Tree