Orderings Defined by a PQ Tree
Given a PQ tree T the orderings defined by T is
PQ(T) ={F(T’) : T’ is equivalent to T}
A
C
F
E
D
B
T
There are 6 x 2 x 2 = 24 distinct
orderings in PQ(T).
Previous slide
Next slide
Back to first slide
View graphic version