average-of-levels-in-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{
pubfnaverage_of_levels(root:Option<Rc<RefCell<TreeNode>>>) -> Vec<f64>{
if root.is_none(){
returnvec![];
}

letmut result = vec![];
letmut stack = vec![root];

while !stack.is_empty(){
letmut s = vec![];
letmut l = stack.len();
letmut sum = 0;

whileletSome(v) = stack.pop(){
if v.is_none(){
continue;
}

let v = v.unwrap();
 sum += v.borrow().valasi64;
let left = v.borrow_mut().left.take();
if left.is_some(){
 s.push(left);
}

let right = v.borrow_mut().right.take();
if right.is_some(){
 s.push(right);
}
}

 result.push(sum asf64 / l asf64);
 stack = s;
}

 result
}
}