Module gen.tree

Package io.github.astrapi69.tree

Class SimpleTreeNode<T,K>

java.lang.Object

io.github.astrapi69.tree.SimpleTreeNode<T,K>

Type Parameters:

T - the generic type of the value

All Implemented Interfaces:

io.github.astrapi69.design.pattern.visitor.Acceptable<io.github.astrapi69.design.pattern.visitor.Visitor<SimpleTreeNode<T,K>>>

public class SimpleTreeNode<T,K>
extends java.lang.Object
implements io.github.astrapi69.design.pattern.visitor.Acceptable<io.github.astrapi69.design.pattern.visitor.Visitor<SimpleTreeNode<T,K>>>

The generic class SimpleTreeNode holds only the parent, the left most child and the right sibling

Constructor Summary

Constructors

Constructor	Description
SimpleTreeNode(T value)	Instantiates a new SimpleTreeNode object

Method Summary

Modifier and Type	Method	Description
void	accept(io.github.astrapi69.design.pattern.visitor.Visitor<SimpleTreeNode<T,K>> visitor)
java.util.Collection<SimpleTreeNode<T,K>>	getAllLeftSiblings()	Gets all the left siblings from this node
java.util.Collection<SimpleTreeNode<T,K>>	getAllRightSiblings()	Gets all the right siblings from this node
java.util.Collection<SimpleTreeNode<T,K>>	getAllSiblings()	Gets all the siblings from this node
java.util.Collection<SimpleTreeNode<T,K>>	getChildren()	Gets the children
int	getLevel()	Returns the distance from the root to this node.
SimpleTreeNode<T,K>	getRoot()	Gets the root SimpleTreeNode object
boolean	hasLeftMostChild()	Checks if this node has a left most child
boolean	hasParent()	Checks if this node has a parent
boolean	hasRightSibling()	Checks if this node has a right sibling
boolean	isRoot()	Checks if this SimpleTreeNode is the root SimpleTreeNode object
java.util.Collection<SimpleTreeNode<T,K>>	traverse()	Traverse this node and add all descendant with this included in to a Set

Methods inherited from class java.lang.Object

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

Constructor Detail

SimpleTreeNode

public SimpleTreeNode(T value)

Instantiates a new SimpleTreeNode object

Parameters:

value - the value

Method Detail

getLevel

public int getLevel()

Returns the distance from the root to this node. Returns 0 if this node is the root.

Returns:

the level from this node.

getRoot

public SimpleTreeNode<T,K> getRoot()

Gets the root SimpleTreeNode object

Returns:

the root SimpleTreeNode object

isRoot

public boolean isRoot()

Checks if this SimpleTreeNode is the root SimpleTreeNode object

Returns:

true, if this SimpleTreeNode is the root SimpleTreeNode object

getAllSiblings

public java.util.Collection<SimpleTreeNode<T,K>> getAllSiblings()

Gets all the siblings from this node

Returns:

all the siblings from this node

getAllLeftSiblings

public java.util.Collection<SimpleTreeNode<T,K>> getAllLeftSiblings()

Gets all the left siblings from this node

Returns:

all the left siblings from this node

getAllRightSiblings

public java.util.Collection<SimpleTreeNode<T,K>> getAllRightSiblings()

Gets all the right siblings from this node

Returns:

all the right siblings from this node

hasParent

public boolean hasParent()

Checks if this node has a parent

Returns:

true, if successful

hasRightSibling

public boolean hasRightSibling()

Checks if this node has a right sibling

Returns:

true, if successful

hasLeftMostChild

public boolean hasLeftMostChild()

Checks if this node has a left most child

Returns:

true, if successful

traverse

public java.util.Collection<SimpleTreeNode<T,K>> traverse()

Traverse this node and add all descendant with this included in to a Set

Returns:

a Set with this node and add all descendant

getChildren

public java.util.Collection<SimpleTreeNode<T,K>> getChildren()

Gets the children

Returns:

the children

accept

public void accept(io.github.astrapi69.design.pattern.visitor.Visitor<SimpleTreeNode<T,K>> visitor)

Specified by:

accept in interface io.github.astrapi69.design.pattern.visitor.Acceptable<T>