|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectgoldman.collection.ordered.AbstractSearchTree.TreeNode
goldman.collection.ordered.BinarySearchTree.BSTNode
protected class BinarySearchTree.BSTNode
Field Summary | |
---|---|
protected E |
data
|
protected BinarySearchTree.BSTNode |
left
|
protected BinarySearchTree.BSTNode |
parent
|
protected BinarySearchTree.BSTNode |
right
|
Constructor Summary | |
---|---|
protected |
BinarySearchTree.BSTNode(E data)
|
Method Summary | |
---|---|
protected int |
capacity()
|
protected BinarySearchTree.BSTNode |
child(int index)
|
protected E |
data(int index)
|
protected BinarySearchTree.BSTNode |
deleteAndReplaceBy(BinarySearchTree.BSTNode x)
Replaces T( this ) by T(x ) |
protected BinarySearchTree.BSTNode |
grandparent()
REQUIRES: it is not called on the root |
protected boolean |
isFrontier()
|
protected boolean |
isLeftChild()
REQUIRES: it is not called on the root |
protected BinarySearchTree.BSTNode |
replaceSubtreeBy(BinarySearchTree.BSTNode x)
Replaces T( this ) by T(x ) |
protected BinarySearchTree.BSTNode |
sameSideChild()
REQUIRES: it is not called on the root. |
protected BinarySearchTree.BSTNode |
setLeft(BinarySearchTree.BSTNode x)
|
protected BinarySearchTree.BSTNode |
setRight(BinarySearchTree.BSTNode x)
|
protected BinarySearchTree.BSTNode |
sibling()
REQUIRES: it is not called on the root |
protected int |
size()
|
protected void |
substituteNode(BinarySearchTree.BSTNode x)
Replaces the node on which this method is called by x |
String |
toString()
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Field Detail |
---|
protected E data
protected BinarySearchTree.BSTNode parent
protected BinarySearchTree.BSTNode left
protected BinarySearchTree.BSTNode right
Constructor Detail |
---|
protected BinarySearchTree.BSTNode(E data)
data
- the element to be held in this nodeMethod Detail |
---|
protected final int size()
size
in class AbstractSearchTree.TreeNode
protected final int capacity()
capacity
in class AbstractSearchTree.TreeNode
public String toString()
toString
in class Object
protected final boolean isFrontier()
isFrontier
in class AbstractSearchTree.TreeNode
protected final E data(int index)
data
in class AbstractSearchTree.TreeNode
index
- the desired index
index
}
IllegalArgumentException
- index
is not 0 since a binary search
tree only holds a single element in each node
NoSuchElementException
- this node is not in useprotected final BinarySearchTree.BSTNode child(int index)
child
in class AbstractSearchTree.TreeNode
index
- the index for the desired child
index
}
IllegalArgumentException
- index is not 0 or 1protected final BinarySearchTree.BSTNode setLeft(BinarySearchTree.BSTNode x)
x
- a reference to the node that is to
become the left child of this node
x
protected final BinarySearchTree.BSTNode setRight(BinarySearchTree.BSTNode x)
x
- a reference to the
node that is to become the right child of this node
x
protected final boolean isLeftChild()
protected final BinarySearchTree.BSTNode grandparent()
protected final BinarySearchTree.BSTNode sibling()
protected final BinarySearchTree.BSTNode sameSideChild()
protected BinarySearchTree.BSTNode replaceSubtreeBy(BinarySearchTree.BSTNode x)
this
) by T(x
)
x
- a reference to a node
left
) ≤
x.element
≤ T(right
)
x
protected BinarySearchTree.BSTNode deleteAndReplaceBy(BinarySearchTree.BSTNode x)
this
) by T(x
)
x
- a reference to a node
left
) ≤
x.element
≤ T(right
)
x
protected void substituteNode(BinarySearchTree.BSTNode x)
x
- a reference to a node
left
) ≤
x.element
≤ T(right
)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |