BinaryNode - { element = theElement; left = lt; right = rt;...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
package DataStructures; // Basic node stored in unbalanced binary search trees // Note that this class is not accessible outside // of package DataStructures class BinaryNode { // Constructors BinaryNode( Comparable theElement ) { this( theElement, null, null ); } BinaryNode( Comparable theElement, BinaryNode lt, BinaryNode rt )
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: { element = theElement; left = lt; right = rt; } // Friendly data; accessible by other package routines Comparable element; // The data in the node BinaryNode left; // Left child BinaryNode right; // Right child }...
View Full Document

This note was uploaded on 04/22/2011 for the course CSC 532 taught by Professor Dr.gursaranadhar during the Spring '07 term at University of North Carolina Wilmington.

Ask a homework question - tutors are online