Algorithm
Development Kit 1.0

algs.model.tree
Interface IVisitor<T extends java.lang.Comparable<T>>

Type Parameters:
T -
All Known Implementing Classes:
BinaryTreeDebugger, RightThreadTreeDebugger

public interface IVisitor<T extends java.lang.Comparable<T>>

Visitor of nodes.

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

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

Method Detail

visit

void visit(BinaryNode<T> parent,
           BinaryNode<T> 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.