find_in_pq.py

def find_in_pq(pq, s, c):
    if get_data(pq, s) == c:
        return s
    elif get_data(pq, s) > c:
        return None
    found_below = None
    for i in children(pq, s):
        found_below = find_in_pq(pq, i, c)
        if found_below:
            return found_below
    return None

Example implementation of search in a priority queue pq; the search is from node s trying to find a node containing c.