org.ranksys.core.util

Class BinaryTree.Node

java.lang.Object

org.ranksys.core.util.BinaryTree.Node

Enclosing class:

BinaryTree<N extends BinaryTree.Node>

public abstract static class BinaryTree.Node
extends Object

Node of a binary tree.

Constructor Summary

Constructors

Constructor and Description
Node() Constructor.

Method Summary

Modifier and Type	Method and Description
protected int	depth() Computes recursively the depth of the sub-tree whose root is this node.
BinaryTree.Node	getLeftChild() Returns the left child of this node.
BinaryTree.Node	getParent() Returns the parent node (if any) of this node.
BinaryTree.Node	getRightChild() Returns the right child of this node.
boolean	isLeaf() Determines whether the node is a leaf in the tree.
protected int	numNodes() Computes recursively the number of nodes under the current node, including itself.
void	setLeftChild(BinaryTree.Node leftChild) Sets a node as left child of this node.
void	setRightChild(BinaryTree.Node rightChild) Sets a node as right child of this node.

Methods inherited from class java.lang.Object

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

Constructor Detail

Node

public Node()

Constructor.

Method Detail

getParent

public BinaryTree.Node getParent()

Returns the parent node (if any) of this node.

Returns:

parent node

getLeftChild

public BinaryTree.Node getLeftChild()

Returns the left child of this node.

Returns:

left child

setLeftChild

public void setLeftChild(BinaryTree.Node leftChild)

Sets a node as left child of this node.

Parameters:

leftChild - left child

getRightChild

public BinaryTree.Node getRightChild()

Returns the right child of this node.

Returns:

right child

setRightChild

public void setRightChild(BinaryTree.Node rightChild)

Sets a node as right child of this node.

Parameters:

rightChild - right node

isLeaf

public boolean isLeaf()

Determines whether the node is a leaf in the tree.

Returns:

true if it is leaf, false otherwise

numNodes

protected int numNodes()

Computes recursively the number of nodes under the current node, including itself.

Returns:

number of descendants plus itself

depth

protected int depth()

Computes recursively the depth of the sub-tree whose root is this node.

Returns:

depth of the sub-tree