Package scranton.tree

Contains several interfaces for trees along with implementations.

See:
Description

Interface Summary

Heap	Heap interface, assume a comparator applies the heap order.
PositionalBinaryTree	A class that represents a positional binary tree with a recursive binary tree and a stack.
RecursiveBinaryTree	This interface describes one interpretation of an object oriented versions of the recursive binary tree found in McCarthey's LISP.

Class Summary

BinarySearchTree	Implements a binary search tree by extending RecursiveBinaryTreeViaLinear1.
HeapViaArray	Heap Class: Manages a heap in an array applying a comparator.
PositionalBinaryTreeViaRecTreeWStk	A class that represents a positional binary tree with a recursive binary tree and a stack.
RecursiveBinaryTreeViaLinear1	This interface describes one interpretation of an object oriented versions of the recursive binary tree found in McCarthey's LISP.

Package scranton.tree Description

Contains several interfaces for trees along with implementations.