Uses of Class
net.cscott.jutil.BinaryTree.Node
-
Uses of BinaryTree.Node in net.cscott.jutil
Subclasses of BinaryTree.Node in net.cscott.jutilModifier and TypeClassDescriptionprotected classARedBlackTree<K>.RBNodeis an element of this tree.Fields in net.cscott.jutil declared as BinaryTree.NodeMethods in net.cscott.jutil that return BinaryTree.NodeModifier and TypeMethodDescriptionConstructs a node forkand inserts it into this.protected final BinaryTree<K>.NodeBinaryTree.Node.left()protected BinaryTree<K>.NodeCreates aBinaryTree<K>.Noden for this such that n.key == k.protected BinaryTree<IntervalTree.Interval>.NodeIntervalTree.makeNode(IntervalTree.Interval i) protected BinaryTree<K>.NodeFactory method forBinaryTree<K>.Node.protected BinaryTree<K>.NodeBinaryTree.maximum(BinaryTree<K>.Node x) Finds the maximum Node n (in the subtree rooted at x).protected BinaryTree<K>.NodeBinaryTree.minimum(BinaryTree<K>.Node x) Finds the minimum Node n (in the subtree rooted at x).protected final BinaryTree<K>.NodeBinaryTree.Node.parent()protected final BinaryTree<K>.NodeBinaryTree.Node.right()protected BinaryTree<K>.NodeBinaryTree.root()protected BinaryTree<K>.NodeBinaryTree.search(BinaryTree<K>.Node x, Object k) Finds the Node n (in the subtree rooted at x) such that n.key = k.protected BinaryTree<K>.NodeBinaryTree.setLeft(BinaryTree<K>.Node p, BinaryTree<K>.Node l) Sets the left child of p.protected BinaryTree<IntervalTree.Interval>.NodeIntervalTree.setLeft(BinaryTree<IntervalTree.Interval>.Node p, BinaryTree<IntervalTree.Interval>.Node l) protected BinaryTree<K>.NodeBinaryTree.setParent(BinaryTree<K>.Node c, BinaryTree<K>.Node p) Sets the parent of p.protected BinaryTree<IntervalTree.Interval>.NodeIntervalTree.setParent(BinaryTree<IntervalTree.Interval>.Node c, BinaryTree<IntervalTree.Interval>.Node p) protected BinaryTree<K>.NodeBinaryTree.setRight(BinaryTree<K>.Node p, BinaryTree<K>.Node r) Sets the right child of p.protected BinaryTree<IntervalTree.Interval>.NodeIntervalTree.setRight(BinaryTree<IntervalTree.Interval>.Node p, BinaryTree<IntervalTree.Interval>.Node r) protected BinaryTree<K>.NodeBinaryTree.setRoot(BinaryTree<K>.Node r) protected BinaryTree<K>.NodeBinaryTree.successor(BinaryTree<K>.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.NodeModifier and TypeMethodDescriptionprotected voidBinaryTree.deleteNode(BinaryTree<K>.Node z) Spliceszout from this.protected voidIntervalTree.deleteNode(BinaryTree<IntervalTree.Interval>.Node z) protected voidRedBlackTree.deleteNode(BinaryTree<K>.Node z) BinaryTree.dump(BinaryTree<K>.Node x) protected voidBinaryTree.insertNode(BinaryTree<K>.Node z) Inserts z into some appropriate position inthis.protected voidIntervalTree.insertNode(BinaryTree<IntervalTree.Interval>.Node z) protected voidRedBlackTree.insertNode(BinaryTree<K>.Node x) protected voidRedBlackTree.leftRotate(BinaryTree<K>.Node x) Pivots around the edge (x,x.right).protected BinaryTree<K>.NodeBinaryTree.maximum(BinaryTree<K>.Node x) Finds the maximum Node n (in the subtree rooted at x).protected BinaryTree<K>.NodeBinaryTree.minimum(BinaryTree<K>.Node x) Finds the minimum Node n (in the subtree rooted at x).protected voidRedBlackTree.rbDeleteFixup(BinaryTree<K>.Node x) Post delete fixup routine.protected voidRedBlackTree.rightRotate(BinaryTree<K>.Node x) Pivots around the edge (x,x.left).protected BinaryTree<K>.NodeBinaryTree.search(BinaryTree<K>.Node x, Object k) Finds the Node n (in the subtree rooted at x) such that n.key = k.protected BinaryTree<K>.NodeBinaryTree.setLeft(BinaryTree<K>.Node p, BinaryTree<K>.Node l) Sets the left child of p.protected BinaryTree<IntervalTree.Interval>.NodeIntervalTree.setLeft(BinaryTree<IntervalTree.Interval>.Node p, BinaryTree<IntervalTree.Interval>.Node l) protected BinaryTree<K>.NodeBinaryTree.setParent(BinaryTree<K>.Node c, BinaryTree<K>.Node p) Sets the parent of p.protected BinaryTree<IntervalTree.Interval>.NodeIntervalTree.setParent(BinaryTree<IntervalTree.Interval>.Node c, BinaryTree<IntervalTree.Interval>.Node p) protected BinaryTree<K>.NodeBinaryTree.setRight(BinaryTree<K>.Node p, BinaryTree<K>.Node r) Sets the right child of p.protected BinaryTree<IntervalTree.Interval>.NodeIntervalTree.setRight(BinaryTree<IntervalTree.Interval>.Node p, BinaryTree<IntervalTree.Interval>.Node r) protected BinaryTree<K>.NodeBinaryTree.setRoot(BinaryTree<K>.Node r) protected BinaryTree<K>.NodeBinaryTree.successor(BinaryTree<K>.Node x) Returns the successor of x in the sorted order determined by an inorder tree walk.protected voidBinaryTree.swapPositions(BinaryTree<K>.Node a, BinaryTree<K>.Node b) Switches the positions ofaandbwithinthis.protected voidRedBlackTree.swapPositions(BinaryTree<K>.Node a, BinaryTree<K>.Node b)