|
Algorithm Development Kit 1.0 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
K
- keys in the treeV
- values in the tree (often same as K).public interface IBalancedVisitor<K,V>
Visitor of nodes within the balanced binary tree.
Method Summary | |
---|---|
void |
visit(BalancedBinaryNode<K,V> parent,
BalancedBinaryNode<K,V> n)
Visit a node, and keep in mind its parent. |
Method Detail |
---|
void visit(BalancedBinaryNode<K,V> parent, BalancedBinaryNode<K,V> n)
parent
- parent (or null if root) of node being visited.n
- node being visited
|
Algorithm Development Kit 1.0 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |