|
Algorithm Development Kit 1.0 |
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectalgs.model.tree.BinaryNode<T>
T - the base type of the values stored by the BinaryNode. Must be
Comparable.public class BinaryNode<T extends java.lang.Comparable>
Standard node for an unbalanced binary tree.
Supports ability to be part of graphical output.
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from interface algs.debug.IGraphEntity |
|---|
IGraphEntity.Formatter |
| Constructor Summary | |
|---|---|
BinaryNode(T value)
Default BinaryTree constructor. |
|
| Method Summary | |
|---|---|
BinaryNode<T> |
getLeftSon()
Return the left son associated with this node. |
BinaryNode<T> |
getRightSon()
Return the right son associated with this node. |
T |
getValue()
Return the value for this node. |
java.lang.String |
nodeLabel()
Node Label for binary node. |
java.lang.String |
toString()
Return representation of this node. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
public BinaryNode(T value)
| Method Detail |
|---|
public BinaryNode<T> getLeftSon()
IBinaryTreeNode
getLeftSon in interface IBinaryTreeNodepublic BinaryNode<T> getRightSon()
IBinaryTreeNode
getRightSon in interface IBinaryTreeNodepublic T getValue()
public java.lang.String toString()
toString in class java.lang.Objectpublic java.lang.String nodeLabel()
nodeLabel in interface IGraphEntity
|
Algorithm Development Kit 1.0 | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||