com.objectwave.utility
Class BinaryTree

java.lang.Object
  |
  +--com.objectwave.utility.BinaryTree

public class BinaryTree

extends java.lang.Object

A simple implementation of a binary tree.

Constructor Summary

BinaryTree()

BinaryTree(SorterComparisonIF comp)

Method Summary

void	clear() toss out the tree and start anew.
boolean	contains(java.lang.Object data)
void	dumpTree(java.io.OutputStream os)
java.util.Enumeration	elements()
int	getCapacity() Sum of all available nodes and all used nodes.
SorterComparisonIF	getComparison()
void	insert(java.lang.Object data)
static void	main(java.lang.String[] args)
void	pack() Remove any "reserve" nodes.
com.objectwave.utility.BinaryTree.TreeNode	recursiveFindParent(java.lang.Object data, com.objectwave.utility.BinaryTree.TreeNode curr) This method assumes that curr.data has already been checked.
boolean	remove(java.lang.Object data)
void	reserveCapacity(int size)
void	setComparison(SorterComparisonIF newValue)
int	size()

Methods inherited from class java.lang.Object

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

Constructor Detail

BinaryTree

public BinaryTree()

BinaryTree

public BinaryTree(SorterComparisonIF comp)

Parameters:

comp - com.objectwave.utility.SorterComparisonIF

Method Detail

clear

public void clear()

toss out the tree and start anew.

contains

public boolean contains(java.lang.Object data)

Parameters:

data - java.lang.Object

Returns:

boolean

dumpTree

public void dumpTree(java.io.OutputStream os)

Parameters:

os - OutputStream

elements

public java.util.Enumeration elements()

Returns:

java.util.Enumeration

getCapacity

public int getCapacity()

Sum of all available nodes and all used nodes.

Returns:

int

getComparison

public SorterComparisonIF getComparison()

Returns:

com.objectwave.utility.SorterComparisonIF

insert

public void insert(java.lang.Object data)

Parameters:

data - java.lang.Object

main

public static void main(java.lang.String[] args)

Parameters:

args - java.lang.String[]

pack

public void pack()

Remove any "reserve" nodes.

recursiveFindParent

public com.objectwave.utility.BinaryTree.TreeNode recursiveFindParent(java.lang.Object data,
                                                                      com.objectwave.utility.BinaryTree.TreeNode curr)

This method assumes that curr.data has already been checked.

Parameters:

data - java.lang.Object

Returns:

TreeNode

remove

public boolean remove(java.lang.Object data)

Parameters:

data - java.lang.Object

Returns:

boolean

reserveCapacity

public void reserveCapacity(int size)

Parameters:

size - int

setComparison

public void setComparison(SorterComparisonIF newValue)

Parameters:

newValue - com.objectwave.utility.SorterComparisonIF

size

public int size()

Returns:

int