TraversalAlgorithmOption

Taking the tree as example, the resulting sequence contains the result in a breath first manner, i.e. if dropRoots = false then the elements of the original sequence are returned first (if dropRoots] = true then they are skipped/dropped), then the children of those elements, then the children of the children and so on.

Taking the tree as example, the resulting sequence contains the result in a depth first manner, i.e. if dropRoots = false then the first element of the original sequence is returned first (if dropRoots] = true then this element is skipped/dropped). Next the first child of this first element is returned, then the first child of the first child etc. Once there is no first child (i.e. we reached a leaf of the tree) the sibling of this child is visited, and again the first child of this sibling etc.

Returns a representation of an immutable list of all enum entries, in the order they're declared.

Returns the enum constant of this type with the specified name. The string must match exactly an identifier used to declare an enum constant in this type. (Extraneous whitespace characters are not permitted.)

Returns an array containing the constants of this enum type, in the order they're declared.