Marking Nodes
Given a set S and PQ tree T we can mark nodes either full or partial.
- A leaf is full if it is a member of S.
- A node is full if all its children are full.
- A node is partial if either it has both full and non-full children or it has a partial child.
- A node is doubly partial if it has two partial children.