LeftHeapNode - { element = theElement; left = lt; right =...

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 leftist heaps // Note that this class is not accessible outside // of package DataStructures class LeftHeapNode { // Constructors LeftHeapNode( Comparable theElement ) { this( theElement, null, null ); } LeftHeapNode( Comparable theElement, LeftHeapNode lt, LeftHeapNode 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; npl = 0; } // Friendly data; accessible by other package routines Comparable element; // The data in the node LeftHeapNode left; // Left child LeftHeapNode right; // Right child int npl; // null path length }...
View Full Document

This document was uploaded on 06/13/2011.

Ask a homework question - tutors are online