treapnode.java

来自「Data StructuresAnd Algorithm Analysis In」· Java 代码 · 共 31 行

    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;
            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( );
    }