range-sum-of-bst.rs

#![allow(dead_code, unused, unused_variables, non_snake_case)]

use std::cell::RefCell;
use std::rc::Rc;

fnmain(){}

structSolution;

// Definition for a binary tree node.
#[derive(Debug,PartialEq,Eq)]
pubstructTreeNode{
pubval:i32,
publeft:Option<Rc<RefCell<TreeNode>>>,
pubright:Option<Rc<RefCell<TreeNode>>>,
}

implTreeNode{
#[inline]
pubfnnew(val:i32) -> Self{
TreeNode{
 val,
left:None,
right:None,
}
}
}

implSolution{
pubfnrange_sum_bst(root:Option<Rc<RefCell<TreeNode>>>,low:i32,high:i32) -> i32{
letmut result = 0;

fndfs(root:Option<Rc<RefCell<TreeNode>>>,result:&muti32,low:i32,high:i32){
if root.is_none(){
return;
}

let root = root.unwrap();
dfs(root.borrow_mut().left.take(), result, low, high);
dfs(root.borrow_mut().right.take(), result, low, high);

if root.borrow().val <= high && root.borrow().val >= low {
*result += root.borrow().val;
}
}

dfs(root,&mut result, low, high);

 result
}
}