Package io.openml.gearbox.binarytree.traversal

Class AbstractPreOrderVisitor<T,R>

java.lang.Object

io.openml.gearbox.binarytree.traversal.AbstractVisitor<T,R>

io.openml.gearbox.binarytree.traversal.AbstractPreOrderVisitor<T,R>

Type Parameters:

T - The type of value stored in the node

R - The type of object to be computed via a pre-order traversal, see AbstractVisitor.getTraversalResult()

All Implemented Interfaces:

Function<TreeNode<T>,R>

Direct Known Subclasses:

PreOrderSearch, Size

@Deprecated
public abstract class AbstractPreOrderVisitor<T,R>
extends AbstractVisitor<T,R>

Deprecated.

AbstractPreOrderVisitor reflects an obsolete implementation that doesn't strictly bind the principle of Visitor pattern. Please use the enhanced TreeTraverser or AbstractPreOrderTraversalVisitor

AbstractPreOrderVisitor performs pre-order tree traversal and allows custom actions on visiting each tree node during the traversal.

Traversing the tree does not allow mutation involved, otherwise the traversal behavior is undefined.

Constructor Summary

Constructors

Constructor	Description
AbstractPreOrderVisitor()	Deprecated.

Method Summary

Modifier and Type	Method	Description
R	apply(TreeNode<T> root)	Deprecated.
protected R	traverse(TreeNode<T> root)	Deprecated. Pre-order traverses the specified tree and performs actions on each visited node.

Methods inherited from class io.openml.gearbox.binarytree.traversal.AbstractVisitor

canTerminate, getTraversalResult, visitNode

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.function.Function

andThen, compose

Constructor Details

AbstractPreOrderVisitor

public AbstractPreOrderVisitor()

Deprecated.

Method Details

traverse

protected R traverse(TreeNode<T> root)

Deprecated.

Pre-order traverses the specified tree and performs actions on each visited node.

This method runs optimally in O(n) time and O(n) space without recursion, i.e. it also invokes AbstractVisitor.getTraversalResult(), AbstractVisitor.visitNode(TreeNode), AbstractVisitor.canTerminate():

• if AbstractVisitor.getTraversalResult() runs in O(m) in time and O(s) in space, this method runs at least MAX[O(n), O(m)] in time and at least MAX[O(n), O(s)] in space
• if AbstractVisitor.visitNode(TreeNode) runs in O(m) in time and O(s) in space, this method runs at least O(n* m) in time and at least MAX[O(n), O(s)] in space
• if AbstractVisitor.canTerminate() runs in O(m) in time and O(s) in space, this method runs at least O(n * m) in time and at least MAX[O(n), O(s)] in space

Parameters:

root - the root of the tree

Returns:

the preorder traversal of the tree

Throws:

NullPointerException - if root is null

apply

public R apply(TreeNode<T> root)

Deprecated.