-
Notifications
You must be signed in to change notification settings - Fork 2
/
merge-two-binary-trees.rs
76 lines (68 loc) · 2.16 KB
/
merge-two-binary-trees.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#![allow(dead_code, unused, unused_variables)]
fn main() {}
struct Solution;
// Definition for a binary tree node.
#[derive(Debug, PartialEq, Eq)]
pub struct TreeNode {
pub val: i32,
pub left: Option<Rc<RefCell<TreeNode>>>,
pub right: Option<Rc<RefCell<TreeNode>>>,
}
impl TreeNode {
#[inline]
pub fn new(val: i32) -> Self {
TreeNode {
val,
left: None,
right: None,
}
}
}
use std::cell::RefCell;
use std::rc::Rc;
impl Solution {
pub fn merge_trees(
t1: Option<Rc<RefCell<TreeNode>>>,
t2: Option<Rc<RefCell<TreeNode>>>,
) -> Option<Rc<RefCell<TreeNode>>> {
if t1.is_some() {
Self::scan(Some(Rc::clone(t1.as_ref().unwrap())), t2);
t1
} else {
t2
}
}
fn scan(t1: Option<Rc<RefCell<TreeNode>>>, t2: Option<Rc<RefCell<TreeNode>>>) {
if t1.is_none() {
return;
} else if t1.is_some() && t2.is_some() {
t1.as_ref().unwrap().borrow_mut().val += t2.as_ref().unwrap().borrow().val;
if t1.as_ref().unwrap().borrow().left.is_some() {
Self::scan(
Some(Rc::clone(
t1.as_ref().unwrap().borrow_mut().left.as_ref().unwrap(),
)),
Rc::clone(t2.as_ref().unwrap()).borrow_mut().left.take(),
);
} else {
t1.as_ref().unwrap().borrow_mut().left =
t2.as_ref().unwrap().borrow_mut().left.take();
}
if t1.as_ref().unwrap().borrow().right.is_some() {
Self::scan(
Some(Rc::clone(
Rc::clone(t1.as_ref().unwrap())
.borrow_mut()
.right
.as_ref()
.unwrap(),
)),
Rc::clone(t2.as_ref().unwrap()).borrow_mut().right.take(),
);
} else {
t1.as_ref().unwrap().borrow_mut().right =
t2.as_ref().unwrap().borrow_mut().right.take();
}
}
}
}