def left_child_index(i):
    """
    :param i: int
        Index of node in array (that is organized as heap)
    :return: int
        Position in array of left child of node
    """

    return 2 * (i + 1) - 1