TreeNodeIterators

Tree is iterated by using `Pre-order Traversal Algorithm" The pre-order traversal is a topologically sorted one, because a parent node is processed before any of its child nodes is done.

Tree is iterated by using `Post-order Traversal Algorithm" In post-order traversal, we starting from most left child. First visit all children of parent, then parent.

Tree is iterated by using `Level-order Traversal Algorithm" In level-order traversal we iterating nodes level by level, starting from root, and going deeper and deeper in tree.

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.