tree-structure-immutable/com.github.adriankuta.datastructure.tree.immutable

Package-level declarations

Types

data class ImmutableTreeNode<T>(val value: T, val children: PersistentList<ImmutableTreeNode<T>> = persistentListOf())

A node in an immutable, persistent n-ary tree. Each node holds a value and an ordered PersistentList of children; nodes never carry a parent back-reference, so a subtree is a self-contained, acyclic value.

Functions

height

fun <T> ImmutableTreeNode<T>.height(): Int

Returns the number of edges on the longest path between this node and a descendant leaf (0 for a leaf). Implemented iteratively, so it is safe on arbitrarily deep trees.

levelOrder

fun <T> ImmutableTreeNode<T>.levelOrder(): List<ImmutableTreeNode<T>>

Returns this subtree's nodes in level-order (breadth-first: the receiver, then its children, then their children, and so on). Implemented iteratively, so it is safe on arbitrarily deep trees.

nodeCount

fun <T> ImmutableTreeNode<T>.nodeCount(): Int

Counts all descendants of this node; the receiver itself is not counted (matching the core TreeNode.nodeCount). Implemented iteratively, so it is safe on arbitrarily deep trees.

postOrder

fun <T> ImmutableTreeNode<T>.postOrder(): List<ImmutableTreeNode<T>>

Returns this subtree's nodes in post-order (each child subtree in order, then the receiver last). Implemented iteratively, so it is safe on arbitrarily deep trees.

preOrder

fun <T> ImmutableTreeNode<T>.preOrder(): List<ImmutableTreeNode<T>>

Returns this subtree's nodes in pre-order (the receiver first, then each child subtree in order). Implemented iteratively, so it is safe on arbitrarily deep trees.