insert-into-a-binary-search-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{
pubfninsert_into_bst(
root:Option<Rc<RefCell<TreeNode>>>,
val:i32,
) -> Option<Rc<RefCell<TreeNode>>>{
if root.is_none(){
returnSome(Rc::new(RefCell::new(TreeNode::new(val))));
}
let v = root.as_ref().unwrap().borrow().val;

if v > val {
let left = root.as_ref().unwrap().borrow_mut().left.take();
 root.as_ref().unwrap().borrow_mut().left = Self::insert_into_bst(left, val);
}else{
let right = root.as_ref().unwrap().borrow_mut().right.take();
 root.as_ref().unwrap().borrow_mut().right = Self::insert_into_bst(right, val);
}

 root
}
}