码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode 669. Trim a Binary Search Tree

时间:2017-09-11 15:19:29      阅读:159      评论:0      收藏:0      [点我收藏+]

标签:span   tree   binary   pre   bin   treenode   nod   element   col   

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:

Input: 
    3
   /   0   4
       2
   /
  1

  L = 1
  R = 3

Output: 
      3
     / 
   2   
  /
 1

Solution:
/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @param {number} L
 * @param {number} R
 * @return {TreeNode}
 */
var trimBST = function(root, L, R) {
    if(root == null)
        return null;
    if(root.val > R) {
        return trimBST(root.left, L ,R);
    }
    if(root.val < L) {
        return trimBST(root.right, L, R)
    }
    
    root.left = trimBST(root.left, L, R);
    root.right = trimBST(root.right, L , R);
    return root;
};

 

LeetCode 669. Trim a Binary Search Tree

标签:span   tree   binary   pre   bin   treenode   nod   element   col   

原文地址:http://www.cnblogs.com/gogolee/p/7504738.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!