data_structures/trees/binaryHeap.py
def insert(self, e):
        """
        Insert an element in the min-heap
        :param e: element to insert
        :return: None
        """
        # Add the element to the bottom of the heap
        self._insert_at_bottom(e)

        # Percolate up the newly added element
        self.__percolate_up_from_bottom()

        Insert an element in the min-heap
        :param e: element to insert
        :return: None
        
Insert an element in the min-heap
Insert an element in the min - heap
def insert(self, e):
        self._insert_at_bottom(e)
        self.__percolate_up_from_bottom()
def insert ( self , e ) : self . _insert_at_bottom ( e ) self . __percolate_up_from_bottom ( )
Insert an element in the min-heap
Insert an element in the min - heap
"""
        Insert an element in the min-heap
        :param e: element to insert
        :return: None
        """ # Add the element to the bottom of the heap # Percolate up the newly added element
None
self
e
element to insert
element to insert