Class LevelOrderVisitor2

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

Binary Tree Level Order Traversal 2 Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7 return its bottom-up level order traversal as: [ [15, 7] [9, 20], [3], ]

///     [3],
/// ]
pub struct LevelOrderVisitor2;

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