Algorithm
Development Kit 1.0

algs.model
Interface IBinaryTreeNode<T>

Type Parameters:
T - Basic type of the nodes of the binary tree.
All Known Implementing Classes:
BinaryNode, RightThreadedBinaryNode, SegmentTreeNode, StoredIntervalsNode

public interface IBinaryTreeNode<T>

Base structure for a BinaryTree ensures there is a typed left and right child.

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

Method Summary
 T getLeftSon()
          Return the left son associated with this node.
 T getRightSon()
          Return the right son associated with this node.
 

Method Detail

getLeftSon

T getLeftSon()
Return the left son associated with this node.


getRightSon

T getRightSon()
Return the right son associated with this node.


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.