kotlin-stdlib/com.javiersc.kotlin.stdlib.tree

Package-level declarations

Types

typealias ChildDeclaration<T> = ChildDeclarationInterface<T>.() -> Unit

class LevelOrderTreeIterator<T>(root: TreeNode<T>) : Iterator<TreeNode<T>>

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.

PostOrderTreeIterator

class PostOrderTreeIterator<T>(root: TreeNode<T>) : Iterator<TreeNode<T>>

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.

PreOrderTreeIterator

class PreOrderTreeIterator<T>(root: TreeNode<T>) : Iterator<TreeNode<T>>

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.

TreeNode

open class TreeNode<T>(val value: T) : Iterable<TreeNode<T>> , ChildDeclarationInterface<T>

Original library: https://github.com/AdrianKuta/Tree-Data-Structure

TreeNodeException

class TreeNodeException @JvmOverloads constructor(message: String? = null, cause: Throwable? = null) : RuntimeException

TreeNodeIterators

enum TreeNodeIterators : Enum<TreeNodeIterators>

Functions

tree

inline fun <T> tree(root: T, defaultIterator: TreeNodeIterators = TreeNodeIterators.PreOrder, childDeclaration: ChildDeclaration<T>): TreeNode<T>

This method can be used to initialize new tree.