MO640 - Multiple-choice question
Which of the statements below are true about Booth and Lueker's linear-time algorithm to build a PQ-tree:I - The algorithm has two steps: one to identify the nodes that must be processed and another to apply the reductions.
II - Every child of a Q node has a pointer to its parent
III - The linear complexity can be confirmed by amortized analysis
A. I and II
B. I and III
C. II
D. III
E. None of the above
Original idea by: Maria Angélica Lopes de Souza
Translation help by: Rafael Soares Padilha
No comments:
Post a Comment