maximum-depth-of-binary-tree.rs

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

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{
pubfnmax_depth(root:Option<Rc<RefCell<TreeNode>>>) -> i32{
if root.is_none(){
return0;
}

let root = root.unwrap();

let left = 1 + Self::max_depth(Rc::clone(&root).borrow_mut().left.take());
let right = 1 + Self::max_depth(Rc::clone(&root).borrow_mut().right.take());

if left > right {
 left
}else{
 right
}
}
}