Algorithm
Development Kit 1.0

algs.model.tree
Interface IBalancedVisitor<K,V>

Type Parameters:
K - keys in the tree
V - values in the tree (often same as K).
All Known Implementing Classes:
BinaryTreeDebugger

public interface IBalancedVisitor<K,V>

Visitor of nodes within the balanced binary tree.

Since:
1.0
Version:
1.0, 6/15/08
Author:
George Heineman

Method Summary
 void visit(BalancedBinaryNode<K,V> parent, BalancedBinaryNode<K,V> n)
          Visit a node, and keep in mind its parent.
 

Method Detail

visit

void visit(BalancedBinaryNode<K,V> parent,
           BalancedBinaryNode<K,V> n)
Visit a node, and keep in mind its parent.

Parameters:
parent - parent (or null if root) of node being visited.
n - node being visited

Algorithm Development Kit 1.0

This code supports the Algorithms in a Nutshell book, published by O'Reilly Media, Inc. in November 2008. Please visit the book web page to learn of any changes to the code repository or to record a potential defect.