public abstract class BinaryTree
extends java.lang.Object
BinTreeNode
.
It provides set/get methods for the root node as well as
several traversal methods.
Traversal methods may be:
"InOrder" (LeftNode->Data->RightNode)
"PreOrder" (Data->LeftNode->RightNode)
"PostOrder" (LeftNode->RightNode->Data)Constructor and Description |
---|
BinaryTree() |
BinaryTree(java.lang.Object o) |
Modifier and Type | Method and Description |
---|---|
protected BinTreeNode |
getRoot() |
protected java.lang.String |
getTraverseMethod() |
void |
inOrderTraverse() |
protected void |
inOrderTraverse(BinTreeNode p) |
void |
insert(java.lang.Comparable input) |
boolean |
isEmpty() |
void |
postOrderTraverse() |
protected void |
postOrderTraverse(BinTreeNode p) |
void |
preOrderTraverse() |
protected void |
preOrderTraverse(BinTreeNode p) |
void |
print() |
protected void |
setRoot(BinTreeNode r) |
protected void |
setTraverseMethod(java.lang.String newmode) |
public void insert(java.lang.Comparable input)
protected java.lang.String getTraverseMethod()
protected void setTraverseMethod(java.lang.String newmode)
protected BinTreeNode getRoot()
protected void setRoot(BinTreeNode r)
public boolean isEmpty()
public void print()
public void preOrderTraverse()
protected void preOrderTraverse(BinTreeNode p)
public void inOrderTraverse()
protected void inOrderTraverse(BinTreeNode p)
public void postOrderTraverse()
protected void postOrderTraverse(BinTreeNode p)
Copyright © 2011, 2013. Daniel P. Dougherty