| | | | | |

Partially Ordered Trees

Definition: A partially ordered tree is a tree T such that:

  1. There is an order relation >= defined for the vertices of T; and
  2. For any vertex p and any child c of p, p >= c

Consequences:

  • The largest element in a partially ordered tree (POT) is the root
  • No conclusion can be drawn about order of children

| | Top of Page | 10. Generic Heap Algorithms, Priority Queues, Heap Sort - 2 of 12