Question 12. 

Considering one of the innovations of the algorithm presented in "Building PQR trees in almost-linear time", published by Telles and Meidanis in 2005, it is correct to say that it:

A) Substitutes the comparing by patterns in PQ trees for a simpler algorithm, which relies only in the types of gray nodes and the LCA (Least Common Ancestor).
B) Separates the construction of PQR trees in two distinct parts, represented by the BUBBLE and REDUCE algorithms.
C) Makes an adaptation to the "Divide and Conquer" technique for dividing the starting tree into smaller sub-trees.
D) Uses a hash algorithm to reduce the amount of information related to white nodes.
E) None of the above.

(Original idea by: Adriano Batista Prieto || Translated by: Celso A. W. Santos)