Uses of Interface
io.openml.gearbox.algorithms.binarytree.TreeNode

Packages that use TreeNode

Package	Description
io.openml.gearbox.algorithms.binarytree
io.openml.gearbox.algorithms.binarytree.pathvisitor

Uses of TreeNode in io.openml.gearbox.algorithms.binarytree

Classes in io.openml.gearbox.algorithms.binarytree that implement TreeNode

Modifier and Type	Class	Description
final class	ImmutableTreeNode<T>	ImmutableTreeNode encapsulates the value, left tree reference, and right tree reference in an immutable state; it also represents a concrete 'Element', i.e.
final class	MutableTreeNode<T>	MutableTreeNode saves the memory footprint of TreeNode and is suitable for the performance intensive application.

Methods in io.openml.gearbox.algorithms.binarytree that return TreeNode

Modifier and Type	Method	Description
TreeNode<T>	BinaryTreeSerde.deserialize(String string, Function<String,T> deserializer)	Deserializes a binary tree in string representation.
static <T> TreeNode<T>	ImmutableTreeNode.emptyNode()	Creates a dummy node with null value, null left subtree, and null right subtree.
static <T> TreeNode<T>	MutableTreeNode.emptyNode()	Creates a dummy node with null value, null left subtree, and null right subtree.
TreeNode<T>	ImmutableTreeNode.getLeft()
TreeNode<T>	MutableTreeNode.getLeft()
TreeNode<T>	TreeNode.getLeft()	Returns the reference to the left child of this tree node.
TreeNode<T>	ImmutableTreeNode.getRight()
TreeNode<T>	MutableTreeNode.getRight()
TreeNode<T>	TreeNode.getRight()	Returns the reference to the right child of this tree node.
static <T> TreeNode<T>	BinaryTree.getRightMostNode(TreeNode<T> root)	Returns the right most leaf of a binary tree.
static <T> TreeNode<T>	BinaryTree.invertTree(TreeNode<T> root)	Inverts a binary tree.
static <T> TreeNode<T>	BinaryTree.mergeTrees(TreeNode<T> first, TreeNode<T> second, BiFunction<T,T,T> valueAdder)	Merges two binary trees and returns the root of the new tree.
static <T> TreeNode<T>	BinaryTree.subtreeWithAllDeepest(TreeNode<T> root)	Returns the binary tree node with the largest depth such that it contains all the deepest nodes in its subtree.
static <T> TreeNode<T>	ImmutableTreeNode.value(T value)	Creates a new TreeNode with the specified node value.
static <T> TreeNode<T>	MutableTreeNode.value(T value)	Creates a new TreeNode with the specified node value.
static <T> TreeNode<T>	ImmutableTreeNode.valueWithLeft(T value, TreeNode<T> left)	Creates a new TreeNode with the specified node value and a left subtree.
static <T> TreeNode<T>	MutableTreeNode.valueWithLeft(T value, TreeNode<T> left)	Creates a new TreeNode with the specified node value and a left subtree.
static <T> TreeNode<T>	ImmutableTreeNode.valueWithLeftAndRight(T value, TreeNode<T> left, TreeNode<T> right)	Creates a new TreeNode with the specified node value, a left subtree, and a right subtree.
static <T> TreeNode<T>	MutableTreeNode.valueWithLeftAndRight(T value, TreeNode<T> left, TreeNode<T> right)	Creates a new TreeNode with the specified node value, a left subtree, and a right subtree.
static <T> TreeNode<T>	ImmutableTreeNode.valueWithRight(T value, TreeNode<T> right)	Creates a new TreeNode with the specified node value and a right subtree.
static <T> TreeNode<T>	MutableTreeNode.valueWithRight(T value, TreeNode<T> right)	Creates a new TreeNode with the specified node value and a right subtree.
TreeNode<T>	ImmutableTreeNode.withLeft(TreeNode<T> newLeft)	Returns a same instance with a specified new left child.
TreeNode<T>	MutableTreeNode.withLeft(TreeNode<T> newLeft)
TreeNode<T>	TreeNode.withLeft(TreeNode<T> newLeft)	Returns a same instance with a specified new left child.
TreeNode<T>	ImmutableTreeNode.withRight(TreeNode<T> newRight)	Returns a same instance with a specified new right child.
TreeNode<T>	MutableTreeNode.withRight(TreeNode<T> newRight)
TreeNode<T>	TreeNode.withRight(TreeNode<T> newRight)	Returns a same instance with a specified new right child.

Methods in io.openml.gearbox.algorithms.binarytree that return types with arguments of type TreeNode

Modifier and Type	Method	Description
static <T> List<TreeNode<T>>	BinaryTree.findDuplicateSubtrees(TreeNode<T> root, Function<T,String> serializer)	Return all duplicate subtrees in a binary tree.
static List<TreeNode<Integer>>	BinaryTree.generateBst(int max)	Returns all structurally unique binary search trees that store values 1 ...
List<TreeNode<T>>	TreeGraph.get(TreeNode<T> key)	Returns an immutable list of all neighbors to which the specified TreeNode key is mapped, or Collections.emptyList() if this TreeGraph map contains no mapping for the key.
Set<TreeNode<T>>	TreeGraph.keySet()	Returns an immutable Set view of the all nodes of the original tree.
static <T> List<List<TreeNode<T>>>	BinaryTree.pathCondition(TreeNode<T> root, Predicate<List<TreeNode<T>>> condition)	Returns all root-to-leaf paths of a binary tree where each path satisfies a given condition.

Methods in io.openml.gearbox.algorithms.binarytree with parameters of type TreeNode

Modifier and Type	Method	Description
static <T,R> boolean	BinaryTree.checkEqualTree(TreeNode<T> root, Function<TreeNode<T>, R> computeProperty)	Returns true if it is possible to partition a binary tree to two trees such that both have the same specified property after removing exactly one edge from the original tree.
static <T> List<TreeNode<T>>	BinaryTree.findDuplicateSubtrees(TreeNode<T> root, Function<T,String> serializer)	Return all duplicate subtrees in a binary tree.
List<TreeNode<T>>	TreeGraph.get(TreeNode<T> key)	Returns an immutable list of all neighbors to which the specified TreeNode key is mapped, or Collections.emptyList() if this TreeGraph map contains no mapping for the key.
static <T> TreeNode<T>	BinaryTree.getRightMostNode(TreeNode<T> root)	Returns the right most leaf of a binary tree.
static <T> TreeNode<T>	BinaryTree.invertTree(TreeNode<T> root)	Inverts a binary tree.
static <T> int	BinaryTree.largestBstSubtree(TreeNode<T> root, Comparator<T> comparator)	Returns the size of the largest BST in a binary tree.
static <T> int	BinaryTree.longestConsecutive(TreeNode<T> root, BiPredicate<T,T> isConsecutive)	Returns the length of the longest consecutive sequence path of a binary tree.
static <T> int	BinaryTree.longestConsecutiveNodeToNode(TreeNode<T> root, BiPredicate<T,T> isConsecutive)	Returns the length of the longest consecutive sequence node-to-node path of a binary tree.
static <T> TreeNode<T>	BinaryTree.mergeTrees(TreeNode<T> first, TreeNode<T> second, BiFunction<T,T,T> valueAdder)	Merges two binary trees and returns the root of the new tree.
static <T> TreeGraph<T>	TreeGraph.of(TreeNode<T> root)	Creates the map view of a specified tree.
static <T> List<List<TreeNode<T>>>	BinaryTree.pathCondition(TreeNode<T> root, Predicate<List<TreeNode<T>>> condition)	Returns all root-to-leaf paths of a binary tree where each path satisfies a given condition.
protected abstract void	AbstractInOrderTraversalVisitor.processNode(TreeNode<T> node)	An abstract method that defines the "visit" operation to be performed on each node during the traversal.
protected abstract void	AbstractPostOrderTraversalVisitor.processNode(TreeNode<T> node)	An abstract method that defines the operation to be performed on each node during the traversal.
protected abstract void	AbstractPreOrderTraversalVisitor.processNode(TreeNode<T> node)	An abstract method that defines the operation to be performed on each node during the traversal.
static <T> void	BinaryTree.recoverTree(TreeNode<T> root, Comparator<T> comparator)	Recover a binary search tree whose 2 elements are out of order.
String	BinaryTreeSerde.serialize(TreeNode<T> root)	Returns a string representation of a binary tree by serializing each node value using the default Objects.toString(Object).
String	BinaryTreeSerde.serialize(TreeNode<T> root, Function<T,String> serializer)	Returns a string representation of a binary tree by serializing each node value using a specified strategy.
void	MutableTreeNode.setLeft(TreeNode<T> left)	Mutates the left child of this node with a specified left subtree.
void	MutableTreeNode.setRight(TreeNode<T> right)	Mutates the right child of this node with a specified lrighteft subtree.
static <T> TreeNode<T>	BinaryTree.subtreeWithAllDeepest(TreeNode<T> root)	Returns the binary tree node with the largest depth such that it contains all the deepest nodes in its subtree.
void	TreeTraverser.traverseInOrder(TreeNode<T> root, Visitor<T> visitor)	Performs an iterative in-order traversal of the tree structure.
void	TreeTraverser.traversePostOrder(TreeNode<T> root, Visitor<T> visitor)	Performs an iterative post-order traversal (Left, Right, Root).
void	TreeTraverser.traversePreOrder(TreeNode<T> root, Visitor<T> visitor)	Performs an iterative pre-order traversal (Root, Left, Right).
static <T> TreeNode<T>	ImmutableTreeNode.valueWithLeft(T value, TreeNode<T> left)	Creates a new TreeNode with the specified node value and a left subtree.
static <T> TreeNode<T>	MutableTreeNode.valueWithLeft(T value, TreeNode<T> left)	Creates a new TreeNode with the specified node value and a left subtree.
static <T> TreeNode<T>	ImmutableTreeNode.valueWithLeftAndRight(T value, TreeNode<T> left, TreeNode<T> right)	Creates a new TreeNode with the specified node value, a left subtree, and a right subtree.
static <T> TreeNode<T>	MutableTreeNode.valueWithLeftAndRight(T value, TreeNode<T> left, TreeNode<T> right)	Creates a new TreeNode with the specified node value, a left subtree, and a right subtree.
static <T> TreeNode<T>	ImmutableTreeNode.valueWithRight(T value, TreeNode<T> right)	Creates a new TreeNode with the specified node value and a right subtree.
static <T> TreeNode<T>	MutableTreeNode.valueWithRight(T value, TreeNode<T> right)	Creates a new TreeNode with the specified node value and a right subtree.
TreeNode<T>	ImmutableTreeNode.withLeft(TreeNode<T> newLeft)	Returns a same instance with a specified new left child.
TreeNode<T>	MutableTreeNode.withLeft(TreeNode<T> newLeft)
TreeNode<T>	TreeNode.withLeft(TreeNode<T> newLeft)	Returns a same instance with a specified new left child.
TreeNode<T>	ImmutableTreeNode.withRight(TreeNode<T> newRight)	Returns a same instance with a specified new right child.
TreeNode<T>	MutableTreeNode.withRight(TreeNode<T> newRight)
TreeNode<T>	TreeNode.withRight(TreeNode<T> newRight)	Returns a same instance with a specified new right child.

Method parameters in io.openml.gearbox.algorithms.binarytree with type arguments of type TreeNode

Modifier and Type	Method	Description
static <T,R> boolean	BinaryTree.checkEqualTree(TreeNode<T> root, Function<TreeNode<T>, R> computeProperty)	Returns true if it is possible to partition a binary tree to two trees such that both have the same specified property after removing exactly one edge from the original tree.
static <T> List<List<TreeNode<T>>>	BinaryTree.pathCondition(TreeNode<T> root, Predicate<List<TreeNode<T>>> condition)	Returns all root-to-leaf paths of a binary tree where each path satisfies a given condition.

Uses of TreeNode in io.openml.gearbox.algorithms.binarytree.pathvisitor

Methods in io.openml.gearbox.algorithms.binarytree.pathvisitor that return TreeNode

Modifier and Type	Method	Description
TreeNode<T>	Path.getLast()	Returns the tail of this path.
TreeNode<T>	Path.removeLast()	Deletes the tail of this path.

Methods in io.openml.gearbox.algorithms.binarytree.pathvisitor that return types with arguments of type TreeNode

Modifier and Type	Method	Description
List<TreeNode<T>>	Path.view()	Returns an immutable view of all path elements in this Path at the time of calling this method.

Methods in io.openml.gearbox.algorithms.binarytree.pathvisitor with parameters of type TreeNode

Modifier and Type	Method	Description
void	Path.addLast(TreeNode<T> pathElement)	Appends a TreeNode to the end of this path.
static <T> RootToLeafPathsMaker<T>	RootToLeafPathsMaker.constructFor(TreeNode<T> root)	Constructs all root-to-leaf paths of a specified binary tree.
protected void	RootToLeafPathsMaker.constructTreePaths(TreeNode<T> root, Path<T> path)	Deprecated. recursion is inefficient on large tree
static <T> DepthCalculator<T>	DepthCalculator.depthOf(TreeNode<T> root)	Takes the root of a binary tree and calculates the depth of the tree rooted at that node.
void	Path.trim(TreeNode<T> expectedTail)	Keeps removing TreeNode elements from end of an under-construction path (last, 2nd last, 3rd last ...) until the element to be removed equals to a specified element.
protected void	AbstractRootToLeafPathVisitor.visit(TreeNode<T> root)	Executes the path-traversal algorithm on a specified binary tree.