btree

Class Btree<E>

java.lang.Object

btree.Btree<E>

public class Btree<E>
extends java.lang.Object

This class is a library of methods that act on BTnodes. It is a library because it does not need to access the instance variables of the BTnode. It has no instance variables of its own.

Version:

July 2005 and April 2007

Author:

Michael Main split apart to be the basic node and supporting tools Beth Katz split class and changed methods to take BTnode as parameter

Constructor Summary

Constructors

Constructor and Description
Btree()

Method Summary

Modifier and Type	Method and Description
static <E> void	inorder(btree.BTnode<E> root, btree.BTnode.Visitor<E> visitor) Uses an inorder traversal to process the data from each node at or below this node of the binary tree.
static <E> void	inorderPrint(btree.BTnode<E> root) Uses an inorder traversal to print the data from each node at or below this node of the binary tree.
static <E> boolean	isLeaf(btree.BTnode<E> node) Accessor method to determine whether a node is a leaf.
static <E> void	postorderPrint(btree.BTnode<E> root) Uses a postorder traversal to print the data from each node at or below this node of the binary tree.
static <E> void	preorderPrint(btree.BTnode<E> root) Uses an preorder traversal to print the data from each node at or below this node of the binary tree.
void	print(btree.BTnode<E> root, int depth) Uses an inorder traversal to print the data from each node at or below this node of the binary tree, with indentations to indicate the depth of each node.
static void	printMany(int count, java.lang.String s) prints a string as many times as specified and doesn't end line
static <E> void	printSideways(btree.BTnode<E> root, int depth) Uses a right-to-left inorder traversal to print the data from each node at or below this node of the binary tree, with indentations to indicate the depth of each node.
static <E> btree.BTnode<E>	treeCopy(btree.BTnode<E> source) Copy a binary tree.
static <E> long	treeSize(btree.BTnode<E> root) Count the number of nodes in a binary tree.

Methods inherited from class java.lang.Object

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

Constructor Detail

Btree

public Btree()

Method Detail

inorderPrint

public static <E> void inorderPrint(btree.BTnode<E> root)

Uses an inorder traversal to print the data from each node at or below this node of the binary tree.

Parameters:

- - none Postcondition: The data of this node and all its descendants have been written by System.out.println( ) using an inorder traversal.

inorder

public static <E> void inorder(btree.BTnode<E> root,
                               btree.BTnode.Visitor<E> visitor)

Uses an inorder traversal to process the data from each node at or below this node of the binary tree.

Parameters:

- - none Postcondition: The data of this node and all its descendants have been handled by the provided visitor method using an inorder traversal.

postorderPrint

public static <E> void postorderPrint(btree.BTnode<E> root)

Uses a postorder traversal to print the data from each node at or below this node of the binary tree.

Parameters:

- - none Postcondition: The data of this node and all its descendants have been written by System.out.println( ) using a postorder traversal.

preorderPrint

public static <E> void preorderPrint(btree.BTnode<E> root)

Uses an preorder traversal to print the data from each node at or below this node of the binary tree.

Parameters:

- - none Postcondition: The data of this node and all its descendants have been written by System.out.println( ) using an inorder traversal.

isLeaf

public static <E> boolean isLeaf(btree.BTnode<E> node)

Accessor method to determine whether a node is a leaf.

Parameters:

- - node the node that is possibly a leaf

Returns:

true (if this node is a leaf) or false (if this node is not a leaf).

print

public void print(btree.BTnode<E> root,
                  int depth)

Uses an inorder traversal to print the data from each node at or below this node of the binary tree, with indentations to indicate the depth of each node.

Parameters:

root - the root node of this subtree

depth - the depth of this node (with 0 for root, 1 for the root's children, and so on) Precondition: depth is the depth of this node. Postcondition: The data of this node and all its descendants have been written by System.out.println( ) using an inorder traversal. The indentation of each line of data is four times its depth in the tree. A dash "--" is printed at any place where a child has no sibling. This is Michael Main's code adapted to having a node parameter.

printMany

public static void printMany(int count,
                             java.lang.String s)

prints a string as many times as specified and doesn't end line

Parameters:

count - the number of times t print string

s - the string to print multiple times

printSideways

public static <E> void printSideways(btree.BTnode<E> root,
                                     int depth)

Uses a right-to-left inorder traversal to print the data from each node at or below this node of the binary tree, with indentations to indicate the depth of each node.

Parameters:

root - the root of this subtree

depth - the depth of this node (with 0 for root, 1 for the root's children, and so on) Precondition: depth is the depth of this node. Postcondition: The data of this node and all its descendants have been writeen by System.out.println( ) using an inorder traversal. The indentation of each line of data corresponds to its depth in the tree. A tilde "~" is printed at any place where a child has no sibling. Based on the C++ binary tree print by Michael Main

treeCopy

public static <E> btree.BTnode<E> treeCopy(btree.BTnode<E> source)

Copy a binary tree.

Parameters:

source - a reference to the root of a binary tree that will be copied (which may be an empty tree where source is null)

Returns:

The method has made a copy of the binary tree starting at source. The return value is a reference to the root of the copy.

Throws:

java.lang.OutOfMemoryError - Indicates that there is insufficient memory for the new tree.

treeSize

public static <E> long treeSize(btree.BTnode<E> root)

Count the number of nodes in a binary tree.

Parameters:

root - a reference to the root of a binary tree (which may be an empty tree where source is null)

Returns:

the number of nodes in the binary tree