|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use BinarySearchTree.BSTNode | |
---|---|
goldman.collection.ordered | An ordered collection is an untagged algorithmically positioned collection of comparable elements that may contain duplicates. |
Uses of BinarySearchTree.BSTNode in goldman.collection.ordered |
---|
Subclasses of BinarySearchTree.BSTNode in goldman.collection.ordered | |
---|---|
class |
RedBlackTree.RBNode
|
Fields in goldman.collection.ordered declared as BinarySearchTree.BSTNode | |
---|---|
protected BinarySearchTree.BSTNode |
BinarySearchTree.FRONTIER_L
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.FRONTIER_R
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.left
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.parent
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.right
|
Methods in goldman.collection.ordered that return BinarySearchTree.BSTNode | |
---|---|
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.child(int index)
|
protected BinarySearchTree.BSTNode |
RedBlackTree.createFrontierNode()
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.createFrontierNode()
|
protected BinarySearchTree.BSTNode |
RedBlackTree.createTreeNode(E data)
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.createTreeNode(E data)
|
protected BinarySearchTree.BSTNode |
RedBlackTree.RBNode.deleteAndReplaceBy(BinarySearchTree.BSTNode x)
Replaces T( this ) by T(x ) |
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.deleteAndReplaceBy(BinarySearchTree.BSTNode x)
Replaces T( this ) by T(x ) |
protected BinarySearchTree.BSTNode |
BinarySearchTree.find(E element)
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.findLastInsertPosition(E element)
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.grandparent()
REQUIRES: it is not called on the root |
protected BinarySearchTree.BSTNode |
RedBlackTree.insert(E element)
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.insert(E element)
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.replaceSubtreeBy(BinarySearchTree.BSTNode x)
Replaces T( this ) by T(x ) |
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.sameSideChild()
REQUIRES: it is not called on the root. |
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.setLeft(BinarySearchTree.BSTNode x)
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.setRight(BinarySearchTree.BSTNode x)
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.sibling()
REQUIRES: it is not called on the root |
Methods in goldman.collection.ordered with parameters of type BinarySearchTree.BSTNode | |
---|---|
void |
BinarySearchTree.clearNodes(BinarySearchTree.BSTNode x)
|
protected BinarySearchTree.BSTNode |
RedBlackTree.RBNode.deleteAndReplaceBy(BinarySearchTree.BSTNode x)
Replaces T( this ) by T(x ) |
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.deleteAndReplaceBy(BinarySearchTree.BSTNode x)
Replaces T( this ) by T(x ) |
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.replaceSubtreeBy(BinarySearchTree.BSTNode x)
Replaces T( this ) by T(x ) |
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.setLeft(BinarySearchTree.BSTNode x)
|
protected BinarySearchTree.BSTNode |
BinarySearchTree.BSTNode.setRight(BinarySearchTree.BSTNode x)
|
protected void |
RedBlackTree.RBNode.substituteNode(BinarySearchTree.BSTNode x)
Replaces the node on which this method is called by x |
protected void |
BinarySearchTree.BSTNode.substituteNode(BinarySearchTree.BSTNode x)
Replaces the node on which this method is called by x |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |