binary-tree-zigzag-level-order-traversal.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{
pubfnzigzag_level_order(root:Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>>{
letmut v = vec![];
if root.is_none(){
return v;
}

letmut l = vec![root];
letmut level = 0;

while !l.is_empty(){
letmut r = Vec::new();
letmut l1 = Vec::new();
whileletSome(x) = l.pop(){
 r.push(x.as_ref().unwrap().borrow().val);
let left = x.as_ref().unwrap().borrow_mut().left.take();
let right = x.as_ref().unwrap().borrow_mut().right.take();

if level % 2 == 0{
if left.is_some(){
 l1.push(left);
}

if right.is_some(){
 l1.push(right);
}
}else{
if right.is_some(){
 l1.push(right);
}

if left.is_some(){
 l1.push(left);
}
}
}

 v.push(r);
 l = l1;
 level += 1;
}

 v
}
}