leetcode-rust/src/leetcode/problem/inorder_traversal.rs at main · martwz/leetcode-rust · GitHub

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
#[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::collections::VecDeque;
use std::rc::Rc;

// 94. Binary Tree Inorder Traversal, Easy
// https://leetcode.com/problems/binary-tree-inorder-traversal/
impl Solution {
    pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
        let mut ans = vec![];

        fn bfs(node: Option<Rc<RefCell<TreeNode>>>, ans: &mut Vec<i32>) {
            if let Some(node) = node {
                bfs(node.borrow().left.clone(), ans);
                ans.push(node.borrow().val);
                bfs(node.borrow().right.clone(), ans);
            }
        }

        bfs(root, &mut ans);

        ans
    }
}

struct Solution {}