def get_right_child_index(parent_index, heap):
    """
    Get the index of the right child given the
    parent node's index.
    """

    # Remember, this is a 1-based index.
    if parent_index * 2 + 1 >= len(heap):
        # There is no right child
        return 0
    
    return parent_index * 2 + 1