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 b863139 commit 8166650Copy full SHA for 8166650
data_structures/heap/skew_heap.py
@@ -15,7 +15,7 @@ def __gt__(self, other: Any) -> bool: ...
15
T = TypeVar("T", bound=Comparable)
16
17
18
-class SkewNode(Generic[T]):
+class SkewNode[T]:
19
"""
20
One node of the skew heap. Contains the value and references to
21
two children.
@@ -94,7 +94,7 @@ def merge(
94
return result
95
96
97
-class SkewHeap(Generic[T]):
+class SkewHeap[T]:
98
99
A data structure that allows inserting a new value and to pop the smallest
100
values. Both operations take O(logN) time where N is the size of the
0 commit comments