A Partially ordered structure is a data structure where not every pair of elements needs to be comparable (compared).
A collection of people ordered by genealogical descendancy:
A Heap is also a sort of partially ordered structure. (ie the parent node should have a bigger value than the child)
A partial order is any binary relation that is: