com.mattunderscore.tree.root.querying

Class QuerierImpl

java.lang.Object

com.mattunderscore.tree.root.querying.QuerierImpl

All Implemented Interfaces:

Querier

public final class QuerierImpl
extends Object
implements Querier

Implementation of Querier.

Author:

Matt Champion on 27/08/2015

Constructor Summary

Constructors

Constructor and Description
QuerierImpl()

Method Summary

Modifier and Type	Method and Description
<E,N extends OpenBinaryTreeNode<E,N>> boolean	isBalanced(N node) Test if the subtree starting at the node is balanced.
<E,N extends OpenBinaryTreeNode<E,N>> boolean	isPerfectlyBalanced(N node) Test if the subtree starting at the node is perfectly balanced.
<E,N extends OpenNode<E,N>,R> R	partialReduce(N node, BiFunction<N,Collection<R>,ReductionResult<R>> reducer) Reduce the subtree starting at a node.
<E,N extends OpenNode<E,N>> SimpleCollection<List<N>>	pathsToLeaves(N node) Find all the paths to leaf nodes from the provided node.

Methods inherited from class java.lang.Object

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

Methods inherited from interface com.mattunderscore.trees.query.Querier

height, height, isBalanced, isPerfectlyBalanced, partialReduce, pathsToLeaves, reduce, reduce

Constructor Detail

QuerierImpl

public QuerierImpl()

Method Detail

pathsToLeaves

public <E,N extends OpenNode<E,N>> SimpleCollection<List<N>> pathsToLeaves(N node)

Description copied from interface: Querier

Find all the paths to leaf nodes from the provided node.

Specified by:

pathsToLeaves in interface Querier

Type Parameters:

E - The element type

N - The node type

Parameters:

node - The starting node

Returns:

A collection of lists. The list starts with the node passed in and ends with a leaf node. The other nodes in the list describe transitions in the path

isBalanced

public <E,N extends OpenBinaryTreeNode<E,N>> boolean isBalanced(N node)

Description copied from interface: Querier

Test if the subtree starting at the node is balanced.

Specified by:

isBalanced in interface Querier

Type Parameters:

E - The element type

N - The node type

Parameters:

node - The node to test

Returns:

If is balanced

isPerfectlyBalanced

public <E,N extends OpenBinaryTreeNode<E,N>> boolean isPerfectlyBalanced(N node)

Description copied from interface: Querier

Test if the subtree starting at the node is perfectly balanced. Allows no difference in the heights of child nodes.

Specified by:

isPerfectlyBalanced in interface Querier

Type Parameters:

E - The element type

N - The node type

Parameters:

node - The node to test

Returns:

If is balanced

partialReduce

public <E,N extends OpenNode<E,N>,R> R partialReduce(N node,
                                                     BiFunction<N,Collection<R>,ReductionResult<R>> reducer)

Description copied from interface: Querier

Reduce the subtree starting at a node. Perform a post order traversal of the tree. Apply the reducer to the node and the results of applying the reducer to the nodes children. The reduction can be stopped early.

Specified by:

partialReduce in interface Querier

Type Parameters:

E - The element type

N - The node type

R - The type of result

Parameters:

node - The node to start the reduction at

reducer - The reducer to apply

Returns:

The result