The node's parent has a priority of 72, the left child has priority 52 and the node's right child has priority 62. Which statement best describes the status of the reheapification. The reheapification is done. All entries of a node are greater than or equal to the entries in the node's children. B. All leaves are at the exact same depth.
All nodes contain the exact same number of entres.
All non-leaf nodes have the exact same number of children. The first piece will have only 1 and the second piece will have the rest of the numbers. The first piece will have 1 through 5 and the second piece will have 6 through 11. The first piece will have 1 through 5 and the second piece will have 7 through 11. The first piece will have 1 through 6 and the second piece will have 7 through 11.