ADT.Heap()->pop()

ADT.Heap()->size()

Method ADT.Heap()->push()

Method push

void push(mixed value)

Description

Push an element onto the heap. The heap will automatically sort itself so that the smallest value will be at the top.