In a PQ-tree, with respect to a new restriction, which of the following statements is true?

   a. If a node is partial, then none of its child nodes is full
   b. If a node is partial, then none of its child nodes is pertinent
   c. If a node has any of its child nodes empty, then it can only be an empty node
   d. If a node has any of its child nodes full, then it can only be a pertinent node
   e. None of the above

Original idea by: Priscila Nascimento Biller
Translate help by: Leandro José de Bortoli