components.binarytree

Class BinaryTreeSecondary<T>

java.lang.Object

components.binarytree.BinaryTreeSecondary<T>

Type Parameters:

T -

All Implemented Interfaces:

BinaryTree<T>, BinaryTreeKernel<T>, Standard<BinaryTree<T>>

Direct Known Subclasses:

BinaryTreeNL

public abstract class BinaryTreeSecondary<T>
extends java.lang.Object
implements BinaryTree<T>

Abstract class providing the implementation of all of the layered secondary methods that were defined in the BinaryTree interface, as well as the implementation for equals, toString, and hashCode methods.

Author:

Matthew Shoemaker

Constructor Summary

Constructors

Constructor and Description
BinaryTreeSecondary()

Method Summary

Modifier and Type	Method and Description
boolean	contains(T node) Reports whether node is in this.
boolean	equals(java.lang.Object o)
void	remove(T node) Searches this for node, and removes it from this.
T	replaceRoot(T replacement) Swaps #this.root with replacement and returns #this.root.
java.lang.String	toString()

Methods inherited from class java.lang.Object

getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface components.binarytree.BinaryTreeKernel

build, height, leftSubtree, rightSubtree, root, size

Methods inherited from interface components.standard.Standard

clear, newInstance, transferFrom

Constructor Detail

BinaryTreeSecondary

public BinaryTreeSecondary()

Method Detail

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

equals

public boolean equals(java.lang.Object o)

Overrides:

equals in class java.lang.Object

replaceRoot

public T replaceRoot(T replacement)

Description copied from interface: BinaryTree

Swaps #this.root with replacement and returns #this.root.

Specified by:

replaceRoot in interface BinaryTree<T>

Parameters:

replacement - new root of this

Returns:

#this.root

contains

public boolean contains(T node)

Description copied from interface: BinaryTree

Reports whether node is in this.

Specified by:

contains in interface BinaryTree<T>

Parameters:

node - node to search for

Returns:

whether node is in this

remove

public void remove(T node)

Description copied from interface: BinaryTree

Searches this for node, and removes it from this. The binary tree represented by this is restructured such that the left-most node of the right subtree of the binary tree rooted at node is moved to the root of that subtree. If there is no right subtree, then the right-most node of the left subtree of the binary tree rooted at node is moved to the root of that subtree. In the case that node is a leaf, it is simply removed.

Specified by:

remove in interface BinaryTree<T>

Parameters:

node - node to be removed from this