TreapNode - left = lt; right = rt; priority =...

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 treaps // Note that this class is not accessible outside // of package DataStructures class TreapNode { // Constructors TreapNode( Comparable theElement ) { this( theElement, null, null ); } TreapNode( Comparable theElement, TreapNode lt, TreapNode rt ) { element = theElement;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: left = lt; right = rt; priority = randomObj.randomInt( ); } // Friendly data; accessible by other package routines Comparable element; // The data in the node TreapNode left; // Left child TreapNode right; // Right child int priority; // Priority private static Random randomObj = new Random( ); }...
View Full Document

Ask a homework question - tutors are online