PQ Tree Notes
In algorithmic design only a linear number of nodes are ever processed.
Designing the data structures to make the linear time processing a reality is very tricky.
PQ trees solve the idealized DNA ordering problem.
In reality, because of errors, the DNA ordering problem is NP-hard and other techniques are use.