data_structures.heap.min_heap
=============================

.. py:module:: data_structures.heap.min_heap


Attributes
----------

.. autoapisummary::

   data_structures.heap.min_heap.a
   data_structures.heap.min_heap.b
   data_structures.heap.min_heap.e
   data_structures.heap.min_heap.my_min_heap
   data_structures.heap.min_heap.r
   data_structures.heap.min_heap.x


Classes
-------

.. autoapisummary::

   data_structures.heap.min_heap.MinHeap
   data_structures.heap.min_heap.Node


Module Contents
---------------

.. py:class:: MinHeap(array)

   >>> r = Node("R", -1)
   >>> b = Node("B", 6)
   >>> a = Node("A", 3)
   >>> x = Node("X", 1)
   >>> e = Node("E", 4)
   >>> print(b)
   Node(B, 6)
   >>> myMinHeap = MinHeap([r, b, a, x, e])
   >>> myMinHeap.decrease_key(b, -17)
   >>> print(b)
   Node(B, -17)
   >>> myMinHeap["B"]
   -17


   .. py:method:: __getitem__(key)


   .. py:method:: build_heap(array)


   .. py:method:: decrease_key(node, new_value)


   .. py:method:: get_left_child_idx(idx)


   .. py:method:: get_parent_idx(idx)


   .. py:method:: get_right_child_idx(idx)


   .. py:method:: get_value(key)


   .. py:method:: insert(node)


   .. py:method:: is_empty()


   .. py:method:: peek()


   .. py:method:: remove()


   .. py:method:: sift_down(idx, array)


   .. py:method:: sift_up(idx)


   .. py:attribute:: heap


   .. py:attribute:: heap_dict


   .. py:attribute:: idx_of_element


.. py:class:: Node(name, val)

   .. py:method:: __lt__(other)


   .. py:method:: __str__()


   .. py:attribute:: name


   .. py:attribute:: val


.. py:data:: a

.. py:data:: b

.. py:data:: e

.. py:data:: my_min_heap

.. py:data:: r

.. py:data:: x