Uses of Interface
edu.princeton.cs.algs4.growingtree.interfaces.IAlgorithmNode

Packages that use IAlgorithmNode

edu.princeton.cs.algs4.growingtree.demos
edu.princeton.cs.algs4.growingtree.experiments
edu.princeton.cs.algs4.growingtree.framework
edu.princeton.cs.algs4.growingtree.interfaces

Uses of IAlgorithmNode in edu.princeton.cs.algs4.growingtree.demos

Methods in edu.princeton.cs.algs4.growingtree.demos that return IAlgorithmNode

IAlgorithmNode<P>	LLRBDeletion.delete(IAlgorithmNode<P> h, IDeletingNode<P> key)
IAlgorithmNode<P>	LLRBDeletion.getPostDeletionValidNode(IAlgorithmNode<P> root, IDeletingNode<P> node)
IAlgorithmNode<P>	BSTSearch.search(ISearchingNode<P> root, java.lang.Comparable<INode<P>> keyCompare)
static <P extends RankNodeProperties> IAlgorithmNode<P>	RankUtils.sibling(IAlgorithmNode<P> n)

Methods in edu.princeton.cs.algs4.growingtree.demos with parameters of type IAlgorithmNode

IAlgorithmNode<P>	LLRBDeletion.delete(IAlgorithmNode<P> h, IDeletingNode<P> key)
static <P extends RankNodeProperties> void	RankUtils.demote(IAlgorithmNode<P> q)
static <P extends RankNodeProperties> void	RankUtils.diffUpdate(IAlgorithmNode<P> n)
void	AVLDeletion.doDelete(IAlgorithmNode<P> root, IDeletingNode<P> node)
void	BSTDeletion.doDelete(IAlgorithmNode<P> root, IDeletingNode<P> node)
void	LLRBDeletion.doDelete(IAlgorithmNode<P> root, IDeletingNode<P> node)
void	RandomizedBSTDeletion.doDelete(IAlgorithmNode<P> root, IDeletingNode<P> node)
void	RankDeletion.doDelete(IAlgorithmNode<P> root, IDeletingNode<P> node)
void	RedBlackDeletion.doDelete(IAlgorithmNode<P> root, IDeletingNode<P> node)
void	SplayOperators.SplayDeletion.doDelete(IAlgorithmNode<P> root, IDeletingNode<P> node)
IAlgorithmNode<P>	LLRBDeletion.getPostDeletionValidNode(IAlgorithmNode<P> root, IDeletingNode<P> node)
static <P extends RankNodeProperties> boolean	RankUtils.hasValidRankDiffs(IAlgorithmNode<P> root)
boolean	LLRBOperator.isRed(IAlgorithmNode<P> h)
boolean	RedBlackOperator.isRed(IAlgorithmNode<P> h)
static <P extends RankNodeProperties> void	RankUtils.promote(IAlgorithmNode<P> q)
static <P extends RankNodeProperties> int	RankUtils.rank(IAlgorithmNode<P> n)
static <P extends RankNodeProperties> void	RankUtils.rotateUp(IAlgorithmNode<P> q)
static <P extends RankNodeProperties> IAlgorithmNode<P>	RankUtils.sibling(IAlgorithmNode<P> n)
<P extends NodeProperties> void	SplayOperators.splay(IAlgorithmNode<P> x, IAlgorithmNode<P> root)
<P extends NodeProperties> void	SplayOperators.splay(IAlgorithmNode<P> x, IAlgorithmNode<P> root)

Uses of IAlgorithmNode in edu.princeton.cs.algs4.growingtree.experiments

Methods in edu.princeton.cs.algs4.growingtree.experiments with parameters of type IAlgorithmNode

void	ExperimentTree.logOther(IAlgorithmNode<P> n, int event_id)
void	IExperimentLogger.logOther(IAlgorithmNode<P> n, int event_id) Catch-all logging function for anything missed by the others.
void	RotationHeightLogger.logOther(IAlgorithmNode<P> n, int eventId)

Uses of IAlgorithmNode in edu.princeton.cs.algs4.growingtree.framework

Classes in edu.princeton.cs.algs4.growingtree.framework that implement IAlgorithmNode

class

ShadowNode<P extends NodeProperties> This class defines the nodes that interact directly with the operators defined by the client.

Methods in edu.princeton.cs.algs4.growingtree.framework that return IAlgorithmNode

IAlgorithmNode<P>

GrowingTreeNode.insertNode(GrowingTreeNode<P> node)

Uses of IAlgorithmNode in edu.princeton.cs.algs4.growingtree.interfaces

Subinterfaces of IAlgorithmNode in edu.princeton.cs.algs4.growingtree.interfaces

interface	IDeletingNode<P extends NodeProperties> This interface is used by IDeleteOperator to delete a node.
interface	IInsertingNode<P extends NodeProperties> This interface is for use by an IInsertOperator to traverse and manipulate the tree.
interface	ISearchingNode<P extends NodeProperties> This interface is for use by an ISearchOperator to traverse the tree to find the node being sought.

Methods in edu.princeton.cs.algs4.growingtree.interfaces that return IAlgorithmNode

IAlgorithmNode<P>	IAlgorithmNode.getLeft()
IAlgorithmNode<P>	IAlgorithmNode.getParent()
IAlgorithmNode<P>	IAlgorithmNode.getPredecessor()
IAlgorithmNode<P>	IAlgorithmNode.getRight()
IAlgorithmNode<P>	IAlgorithmNode.getRoot()
IAlgorithmNode<P>	IAlgorithmNode.getSuccessor()
IAlgorithmNode<P>	IInsertingNode.insertLeft(INode<P> newNode) This should only be called once per call to IInsertOperator.doInsert
IAlgorithmNode<P>	IInsertingNode.insertRight(INode<P> newNode) This should only be called once per call to IInsertOperator.doInsert
IAlgorithmNode<P>	IDeletingNode.predecessorHibbardDelete() Identical to successorHibbardDelete, except swaps with predecessor.
IAlgorithmNode<P>	IAlgorithmNode.rotateLeft() Rotates the left child up.
IAlgorithmNode<P>	IAlgorithmNode.rotateRight() Rotates the right child up.
IAlgorithmNode<P>	IDeletingNode.successorHibbardDelete() This performs Hibbard deletion.

Methods in edu.princeton.cs.algs4.growingtree.interfaces with parameters of type IAlgorithmNode

void	IDeleteOperator.doDelete(IAlgorithmNode<P> root, IDeletingNode<P> node)