invert-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{
pubfninvert_tree(root:Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>>{
if root.is_none(){
returnNone;
}

letmut root = root;
let left = root.as_ref().unwrap().borrow_mut().left.take();
let right = root.as_ref().unwrap().borrow_mut().right.take();
 root.as_mut().unwrap().borrow_mut().right = Self::invert_tree(left);
 root.as_mut().unwrap().borrow_mut().left = Self::invert_tree(right);

 root
}
}