(int k)
| 160 | |
| 161 | // is subtree of pq[1..n] rooted at k a max heap? |
| 162 | private boolean isMaxHeapOrdered(int k) { |
| 163 | if (k > n) return true; |
| 164 | int left = 2 * k; |
| 165 | int right = 2 * k + 1; |
| 166 | if (left <= n && less(k, left)) return false; |
| 167 | if (right <= n && less(k, right)) return false; |
| 168 | return isMaxHeapOrdered(left) && isMaxHeapOrdered(right); |
| 169 | } |
| 170 | |
| 171 | |
| 172 | /** |