checks where the key exists in heap or not concode_field_sep Map<T,Integer> nodePosition concode_elem_sep List<Node> allNodes concode_elem_sep int weight concode_elem_sep T key concode_field_sep void add concode_elem_sep T min concode_elem_sep void printPositionMap concode_elem_sep void swap concode_elem_sep void updatePositionMap concode_elem_sep Integer getWeight concode_elem_sep Node extractMinNode concode_elem_sep void printHeap concode_elem_sep void main concode_elem_sep T extractMin concode_elem_sep void decrease concode_elem_sep boolean empty