data_structures/trees/binaryHeap.py
def __percolate_down(self, start_index):
        """
        Percolate down the element identified by start_index
        :type start_index: int
        :return: None
        """
        current_index = start_index
        max_child_index = self._get_max_child_index(current_index)

        while self.data[current_index] < self.data[max_child_index]:
            self._swap(current_index, max_child_index)
            current_index = max_child_index
            max_child_index = self._get_max_child_index(current_index)

        Percolate down the element identified by start_index
        :type start_index: int
        :return: None
        
Percolate down the element identified by start_index
Percolate down the element identified by start_index
def __percolate_down(self, start_index):
        current_index = start_index
        max_child_index = self._get_max_child_index(current_index)
        while self.data[current_index] < self.data[max_child_index]:
            self._swap(current_index, max_child_index)
            current_index = max_child_index
            max_child_index = self._get_max_child_index(current_index)
def __percolate_down ( self , start_index ) : current_index = start_index max_child_index = self . _get_max_child_index ( current_index ) while self . data [ current_index ] < self . data [ max_child_index ] : self . _swap ( current_index , max_child_index ) current_index = max_child_index max_child_index = self . _get_max_child_index ( current_index )
Percolate down the element identified by start_index
Percolate down the element identified by start_index
"""
        Percolate down the element identified by start_index
        :type start_index: int
        :return: None
        """
None
self
start_index