// Adds the given vаlue tо this priоrity queue (heаp) in оrder.public void аdd(int value) { elements[size + 1] = value; // add as rightmost leaf // "bubble up" as necessary to fix ordering int index = size + 1; boolean found = false; while (!found && hasParent(index)) { int parent = parent(index); if (value < elements[parent]) { elements[index] = elements [parent]; index = parent(index); } else { found = true; // found proper location; stop } } size++;}//The helper methods like parent() are skipped here. No errors about those codes.