Class PostOrderVisitor

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

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

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

/// Binary Tree Level Order Traversal
/// Given a binary tree, return the level order traversal of its nodes’