Update fibonacci_heap.py

Author: Dhruv127

data_structures/heap/fibonacci_heap.py

@@ -15,10 +15,10 @@ class FibonacciTree:
 
     def __init__(self, key: int) -> None:
         self.key = key
-        self.children: list["FibonacciTree"] = []
+        self.children: list['FibonacciTree'] = []
         self.order = 0
 
-    def add_at_end(self, child_node: "FibonacciTree") -> None:
+    def add_at_end(self, child_node: 'FibonacciTree') -> None:
         """
         Adds a child node 'child_node' to the end of the children list.
 
@@ -53,8 +53,8 @@ class FibonacciHeap:
     """
 
     def __init__(self) -> None:
-        self.trees: list["FibonacciTree"] = []
-        self.least: "FibonacciTree" | None = None
+        self.trees: list['FibonacciTree'] = []
+        self.least: 'FibonacciTree' | None = None
         self.count = 0
 
     def insert(self, key: int) -> None:
@@ -66,7 +66,7 @@ def insert(self, key: int) -> None:
         """
         new_tree = FibonacciTree(key)
         self.trees.append(new_tree)
-        if self.least is None or key < self.least.key:
+        if (self.least is None or key < self.least.key):
             self.least = new_tree
         self.count = self.count + 1
 
@@ -88,7 +88,8 @@ def extract_min(self) -> int | None:
         Returns:
             int: The minimum key.
         """
-        if (smallest := self.least) is not None:
+        smallest = self.least
+        if smallest is not None:
             for child in smallest.children:
                 if child is not None:
                     self.trees.append(child)
@@ -110,6 +111,9 @@ def consolidate(self) -> None:
 
         while self.trees:
             x = self.trees[0]
+            if x is None:
+                self.trees.pop(0)  # Remove the None value
+                continue  # Skip processing None values
             order = x.order
             self.trees.remove(x)
             while aux[order] is not None:
@@ -125,10 +129,9 @@ def consolidate(self) -> None:
         for k in aux:
             if k is not None:
                 self.trees.append(k)
-                if self.least is None or k.key < self.least.key:
+                if (self.least is None or k.key < self.least.key):
                     self.least = k
-
-
+                    
 def floor_log2(x: int) -> int:
     """
     Computes the floor of the base-2 logarithm of 'x'.
@@ -141,14 +144,11 @@ def floor_log2(x: int) -> int:
     """
     return math.floor(math.log2(x)) if x > 0 else 0
 
-
 # Doctest for floor_log2
 if __name__ == "__main__":
     import doctest
-
     doctest.testmod()
 
 if __name__ == "__main__":
     import doctest
-
     doctest.testmod()