Tree traversal: Difference between revisions
m
→{{header|Rust}}
Line 10,328:
let mut stack: Vec<&TreeNode<T>> = Vec::new();
let mut res: Vec<&TreeNode<T>> = Vec::new();
let mut
while {
// Descend leftwards
while let Some(tree) =
stack.push(tree);
}
!stack.is_empty()
Line 10,340:
let tree = stack.pop().unwrap();
res.push(tree);
}
res
| |||