def find_intersections(tree, s, e):

    """

    Function to find inserts that bridge a region of a contig.

    Arguments:
    tree: interval tree of start/end positions of mate pair inserts
    s: start position of interval on contig 
    e: end position of interval on contig
     
    Return a list of nodes from tree whose start and end positions span the interval given by s and e. 
    
    """

    # find all reads that bridge a gap
    intersections = []
    tree.intersect(s, e, lambda x: intersections.append(x)) # see interval node for implementation
    return intersections