Uses of Class
net.cscott.jutil.BinaryTree.Node

Uses of BinaryTree.Node in net.cscott.jutil

Subclasses of BinaryTree.Node in net.cscott.jutil

Modifier and Type	Class and Description
protected class	RedBlackTree.RBNode A RedBlackTree.RBNode is an element of this tree.

Fields in net.cscott.jutil declared as BinaryTree.Node

Modifier and Type	Field and Description
protected BinaryTree.Node	BinaryTree.NIL

Methods in net.cscott.jutil that return BinaryTree.Node

Modifier and Type	Method and Description
BinaryTree.Node	BinaryTree.add(java.lang.Object k) Constructs a node for k and inserts it into this.
protected BinaryTree.Node	BinaryTree.Node.left()
protected BinaryTree.Node	BinaryTree.makeNode(java.lang.Object key) Creates a BinaryTree.Node n for this such that n.key == k.
protected BinaryTree.Node	IntervalTree.makeNode(java.lang.Object o) requires: o is-a IntervalTree.Interval.
protected BinaryTree.Node	RedBlackTree.makeNode(java.lang.Object o) Factory method for Node.
protected BinaryTree.Node	BinaryTree.maximum(BinaryTree.Node x) Finds the maximum Node n (in the subtree rooted at x).
protected BinaryTree.Node	BinaryTree.minimum(BinaryTree.Node x) Finds the minimum Node n (in the subtree rooted at x).
protected BinaryTree.Node	BinaryTree.Node.parent()
protected BinaryTree.Node	BinaryTree.Node.right()
protected BinaryTree.Node	BinaryTree.root()
protected BinaryTree.Node	BinaryTree.search(BinaryTree.Node x, java.lang.Object k) Finds the Node n (in the subtree rooted at x) such that n.key = k.
protected BinaryTree.Node	BinaryTree.setLeft(BinaryTree.Node p, BinaryTree.Node l) Sets the left child of p.
protected BinaryTree.Node	IntervalTree.setLeft(BinaryTree.Node p, BinaryTree.Node l)
protected BinaryTree.Node	BinaryTree.setParent(BinaryTree.Node c, BinaryTree.Node p) Sets the parent of p.
protected BinaryTree.Node	IntervalTree.setParent(BinaryTree.Node c, BinaryTree.Node p)
protected BinaryTree.Node	BinaryTree.setRight(BinaryTree.Node p, BinaryTree.Node r) Sets the right child of p.
protected BinaryTree.Node	IntervalTree.setRight(BinaryTree.Node p, BinaryTree.Node r)
protected BinaryTree.Node	BinaryTree.setRoot(BinaryTree.Node r)
protected BinaryTree.Node	BinaryTree.successor(BinaryTree.Node x) Returns the successor of x in the sorted order determined by an inorder tree walk.

Methods in net.cscott.jutil with parameters of type BinaryTree.Node

Modifier and Type	Method and Description
protected void	BinaryTree.deleteNode(BinaryTree.Node z) Splices z out from this.
protected void	RedBlackTree.deleteNode(BinaryTree.Node z)
java.lang.String	BinaryTree.dump(BinaryTree.Node x)
protected void	BinaryTree.insertNode(BinaryTree.Node z) Inserts z into some appropriate position in this.
protected void	RedBlackTree.insertNode(BinaryTree.Node x)
protected void	RedBlackTree.leftRotate(BinaryTree.Node x) Pivots around the edge (x,x.right).
protected BinaryTree.Node	BinaryTree.maximum(BinaryTree.Node x) Finds the maximum Node n (in the subtree rooted at x).
protected BinaryTree.Node	BinaryTree.minimum(BinaryTree.Node x) Finds the minimum Node n (in the subtree rooted at x).
protected void	RedBlackTree.rbDeleteFixup(BinaryTree.Node x) Post delete fixup routine.
protected void	RedBlackTree.rightRotate(BinaryTree.Node x) Pivots around the edge (x,x.left).
protected BinaryTree.Node	BinaryTree.search(BinaryTree.Node x, java.lang.Object k) Finds the Node n (in the subtree rooted at x) such that n.key = k.
protected BinaryTree.Node	BinaryTree.setLeft(BinaryTree.Node p, BinaryTree.Node l) Sets the left child of p.
protected BinaryTree.Node	IntervalTree.setLeft(BinaryTree.Node p, BinaryTree.Node l)
protected BinaryTree.Node	BinaryTree.setParent(BinaryTree.Node c, BinaryTree.Node p) Sets the parent of p.
protected BinaryTree.Node	IntervalTree.setParent(BinaryTree.Node c, BinaryTree.Node p)
protected BinaryTree.Node	BinaryTree.setRight(BinaryTree.Node p, BinaryTree.Node r) Sets the right child of p.
protected BinaryTree.Node	IntervalTree.setRight(BinaryTree.Node p, BinaryTree.Node r)
protected BinaryTree.Node	BinaryTree.setRoot(BinaryTree.Node r)
protected BinaryTree.Node	BinaryTree.successor(BinaryTree.Node x) Returns the successor of x in the sorted order determined by an inorder tree walk.
protected void	BinaryTree.swapPositions(BinaryTree.Node a, BinaryTree.Node b) Switches the positions of a and b within this.
protected void	RedBlackTree.swapPositions(BinaryTree.Node a, BinaryTree.Node b)