org.drip.spaces.big

Class BinaryTree

java.lang.Object

org.drip.spaces.big.BinaryTree

public class BinaryTree
extends java.lang.Object

BinaryTree contains an Implementation of the Left/Right Binary Tree.

Author:

Lakshmi Krishnamurthy

Constructor Summary

Constructors

Constructor and Description
BinaryTree(double dblNode, BinaryTree btParent) BinaryTree Constructor

Method Summary

Modifier and Type	Method and Description
int	ascendingNodeArray(double[] adblNode, int iUpdateStartIndex) Build a Consolidated Ascending Array of all the Constituent Nodes
java.util.List<java.lang.Double>	ascendingNodeList() Build a Consolidated Ascending List of all the Constituent Nodes
boolean	ascendingNodeList(java.util.List<java.lang.Double> lsNode) Build a Consolidated Ascending List of all the Constituent Nodes
int	count() Retrieve the Node Instance Count
boolean	descendingNodeArray(double[] adblNode, int iIndexToUpdate) Build a Consolidated Descending Array of all the Constituent Nodes
java.util.List<java.lang.Double>	descendingNodeList() Build a Consolidated Descending List of all the Constituent Nodes
boolean	descendingNodeList(java.util.List<java.lang.Double> lsNode) Build a Consolidated Descending List of all the Constituent Nodes
BinaryTree	insert(double dblNode) Insert a Node into the Tree
BinaryTree	leftChild() Retrieve the Left Child BinaryTree Instance
BinaryTree	leftMostChild() Retrieve the Left Most Child
double	node() Retrieve the BinaryTree Node Value
BinaryTree	parent() Retrieve the Parent BinaryTree Instance
BinaryTree	rightChild() Retrieve the Right Child BinaryTree Instance
BinaryTree	rightMostChild() Retrieve the Right Most Child

Methods inherited from class java.lang.Object

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

Constructor Detail

BinaryTree

public BinaryTree(double dblNode,
                  BinaryTree btParent)
           throws java.lang.Exception

BinaryTree Constructor

Parameters:

dblNode - The Node Value

btParent - The BinaryTree Parent

Throws:

java.lang.Exception - Thrown if the Inputs are invalid

Method Detail

node

public double node()

Retrieve the BinaryTree Node Value

Returns:

The BinaryTree Node Value

parent

public BinaryTree parent()

Retrieve the Parent BinaryTree Instance

Returns:

The Parent BinaryTree Instance

leftChild

public BinaryTree leftChild()

Retrieve the Left Child BinaryTree Instance

Returns:

The Left Child BinaryTree Instance

rightChild

public BinaryTree rightChild()

Retrieve the Right Child BinaryTree Instance

Returns:

The Right Child BinaryTree Instance

count

public int count()

Retrieve the Node Instance Count

Returns:

The Node Instance Count

insert

public BinaryTree insert(double dblNode)

Insert a Node into the Tree

Parameters:

dblNode - The Node to be inserted

Returns:

The Inserted Node

leftMostChild

public BinaryTree leftMostChild()

Retrieve the Left Most Child

Returns:

The Left Most Child BinaryTree Instance

rightMostChild

public BinaryTree rightMostChild()

Retrieve the Right Most Child

Returns:

The Right Most Child BinaryTree Instance

ascendingNodeList

public boolean ascendingNodeList(java.util.List<java.lang.Double> lsNode)

Build a Consolidated Ascending List of all the Constituent Nodes

Parameters:

lsNode - The Node List

Returns:

TRUE - The Ascending Node List Successfully Built

ascendingNodeList

public java.util.List<java.lang.Double> ascendingNodeList()

Build a Consolidated Ascending List of all the Constituent Nodes

Returns:

The Node List

ascendingNodeArray

public int ascendingNodeArray(double[] adblNode,
                              int iUpdateStartIndex)
                       throws java.lang.Exception

Build a Consolidated Ascending Array of all the Constituent Nodes

Parameters:

adblNode - The Node Array

iUpdateStartIndex - The Update Start Index

Returns:

TRUE - The Ascending Node Array Successfully Built

Throws:

java.lang.Exception - Thrown if the Inputs are Invalid

descendingNodeList

public boolean descendingNodeList(java.util.List<java.lang.Double> lsNode)

Build a Consolidated Descending List of all the Constituent Nodes

Parameters:

lsNode - The Node List

Returns:

TRUE - The Descending Node List Successfully Built

descendingNodeArray

public boolean descendingNodeArray(double[] adblNode,
                                   int iIndexToUpdate)

Build a Consolidated Descending Array of all the Constituent Nodes

Parameters:

adblNode - The Node Array

iIndexToUpdate - The Index To Update

Returns:

TRUE - The Descending Node Array Successfully Built

descendingNodeList

public java.util.List<java.lang.Double> descendingNodeList()

Build a Consolidated Descending List of all the Constituent Nodes

Returns:

The Node List