A pile is an abstract data structure for storing data in a loosely ordered way. There are two different usages of the term; one refers to an ordered deque, the other to an improved heap.

PropertyValue
dbpprop:abstract
  • A pile is an abstract data structure for storing data in a loosely ordered way. There are two different usages of the term; one refers to an ordered deque, the other to an improved heap.
dbpprop:hasPhotoCollection
dbpprop:reference
rdfs:comment
  • A pile is an abstract data structure for storing data in a loosely ordered way. There are two different usages of the term; one refers to an ordered deque, the other to an improved heap.
rdfs:label
  • Pile (data structure)
owl:sameAs
skos:subject
foaf:page
is dbpprop:disambiguates of