BinomialNode - { element = theElement; leftChild = lt;...

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 binomial queues // Note that this class is not accessible outside // of package DataStructures class BinomialNode { // Constructors BinomialNode( Comparable theElement ) { this( theElement, null, null ); } BinomialNode( Comparable theElement, BinomialNode lt, BinomialNode nt )
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; leftChild = lt; nextSibling = nt; } // Friendly data; accessible by other package routines Comparable element; // The data in the node BinomialNode leftChild; // Left child BinomialNode nextSibling; // Right child }...
View Full Document

Ask a homework question - tutors are online