<p>Let X be a set of n items, each with a key and a priority. Forthe sake of simplicity, assume that no two keys or priorities<br/>are identical. A PK-Tree for
<p><img alt="Flip left to right (fliplr) the 1D array ZAP-[1,2,3,.., 10]; and store the results in the new array PAZ whose elements would be PAZ-[10,9,7, ,1] Given A & B