count-good-nodes-in-binary-tree.rs

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

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,
}
}
}
use std::cell::RefCell;
use std::rc::Rc;
implSolution{
pubfngood_nodes(root:Option<Rc<RefCell<TreeNode>>>) -> i32{
if root.is_none(){
return0;
}

let left = root.as_ref().unwrap().borrow_mut().left.take();
let right = root.as_ref().unwrap().borrow_mut().right.take();
let value = root.as_ref().unwrap().borrow().val;

1 + Self::f(value, left) + Self::f(value, right)
}

fnf(max:i32,root:Option<Rc<RefCell<TreeNode>>>) -> i32{
if root.is_none(){
return0;
}

let left = root.as_ref().unwrap().borrow_mut().left.take();
let right = root.as_ref().unwrap().borrow_mut().right.take();
let value = root.as_ref().unwrap().borrow().val;

if value >= max {
1 + Self::f(value, left) + Self::f(value, right)
}else{
Self::f(max, left) + Self::f(max, right)
}
}
}