Class PreOrderVisitor

src/tree/binary/traverse.rs:16–16

Binary Tree Preorder Traversal Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree {1, #, 2, 3}, 1 \ 2 / 3 return [1, 2, 3]. Note: Recursive solution is trivial, could you do it iteratively?

/// return [1, 2, 3].
/// Note: Recursive solution is trivial, could you do it iteratively?
pub struct PreOrderVisitor;

/// Binary Tree Inorder Traversal
/// Given a binary tree, return the inorder traversal of its nodes’ values.