MCPcopy Create free account
hub / github.com/Ainevsia/Leetcode-Rust / traverse

Method traverse

Tree/113. Path Sum II/src/main.rs:51–65  ·  view source on GitHub ↗
(&mut self, root: Rc<RefCell<TreeNode>>)

Source from the content-addressed store, hash-verified

49 pub fn get_res(&self) -> Vec<Vec<i32>> { self.res.clone() }
50
51 pub fn traverse(&mut self, root: Rc<RefCell<TreeNode>>) {
52 self.buf.push(root.borrow().val);
53 if root.borrow().left.is_none() && root.borrow().right.is_none() {
54 if self.buf.iter().sum::<i32>() == self.sum {
55 self.res.push(self.buf.clone());
56 }
57 }
58 if root.borrow().left.is_some() {
59 self.traverse(root.borrow().left.as_ref().unwrap().clone());
60 }
61 if root.borrow().right.is_some() {
62 self.traverse(root.borrow().right.as_ref().unwrap().clone());
63 }
64 self.buf.pop();
65 }
66}
67
68#[cfg(test)]

Callers 1

path_sumMethod · 0.45

Calls 3

pushMethod · 0.45
iterMethod · 0.45
popMethod · 0.45

Tested by

no test coverage detected