data_structures/trees/binaryHeap.py
def __get_min_child_index(self, i):
        """
        Return the child of minimum value of the given node
        :param i: index of the node
        :return: the index of the child
        """
        if 2 * i > self.size:
            return i
        elif 2 * i + 1 > self.size:
            return 2 * i
        else:
            if self.data[2 * i] < self.data[2 * i + 1]:
                return 2 * i
            else:
                return 2 * i + 1

        Return the child of minimum value of the given node
        :param i: index of the node
        :return: the index of the child
        
Return the child of minimum value of the given node
Return the child of minimum value of the given node
def __get_min_child_index(self, i):
        if 2 * i > self.size:
            return i
        elif 2 * i + 1 > self.size:
            return 2 * i
        else:
            if self.data[2 * i] < self.data[2 * i + 1]:
                return 2 * i
            else:
                return 2 * i + 1
def __get_min_child_index ( self , i ) : if 2 * i > self . size : return i elif 2 * i + 1 > self . size : return 2 * i else : if self . data [ 2 * i ] < self . data [ 2 * i + 1 ] : return 2 * i else : return 2 * i + 1
Return the child of minimum value of the given node
Return the child of minimum value of the given node
"""
        Return the child of minimum value of the given node
        :param i: index of the node
        :return: the index of the child
        """
the index of the child
the index of the child
self
i
index of the node
index of the node