Package io.openml.gearbox.algorithms.binarytree
package io.openml.gearbox.algorithms.binarytree
-
ClassDescriptionAn abstract
Visitorthat performs a non-recursive (iterative) in-order traversal of a binary tree.An abstractVisitorthat performs an iterative post-order traversal (Left, Right, Root).An abstractVisitorthat performs an iterative pre-order traversal (Root, Left, Right).Binary tree gearbox that can be used practically.Serializes and deserializes a binary search tree.ImmutableTreeNodeencapsulates the value, left tree reference, and right tree reference in an immutable state; it also represents a concrete 'Element', i.e.MutableTreeNodesaves the memory footprint ofTreeNodeand is suitable for the performance intensive application.TreeGraph<T>TreeGraphis a view on top of a binary tree and maps each tree node to its neighbors, including parent and leftinvalid input: '&right' children.TreeNode<T>An interface representing a node in a binary tree.A class responsible for the traversal logic, separated from theVisitor.Visitable<T>Represents the 'Element' participant in the Visitor pattern.Visitor<T>Represents the 'Visitor' participant in the Visitor pattern.