Enum Traversal 

pub enum Traversal {
    Bfs,
    Dfs,
}

Tree traversal order.

Variants

Bfs

Breadth-first: print all nodes at level N, then N-1, down to leaves.

Dfs

Depth-first: print a node, then recursively its children.

Trait Implementations

impl Clone for Traversal

fn clone(&self) -> Traversal

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Traversal

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for Traversal

fn eq(&self, other: &Traversal) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for Traversal

impl Eq for Traversal

impl StructuralPartialEq for Traversal