We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a2b2951 commit 3361c55Copy full SHA for 3361c55
data_structures/heap/skew_heap.py
@@ -13,7 +13,7 @@ def __lt__(self, other: object) -> bool: ...
13
T = TypeVar("T", bound=Comparable)
14
15
16
-class SkewNode(Generic[T]):
+class SkewNode[T]:
17
"""
18
One node of the skew heap. Contains the value and references to
19
two children.
@@ -90,7 +90,7 @@ def _is_less_than(a: T, b: T) -> bool:
90
return str(a) < str(b)
91
92
93
-class SkewHeap(Generic[T]):
+class SkewHeap[T]:
94
95
A data structure that allows inserting a new value and popping the smallest
96
values. Both operations take O(logN) time where N is the size of the heap.
0 commit comments