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 71cba73 commit 4bb794dCopy full SHA for 4bb794d
data_structures/binary_tree/red_black_tree.py
@@ -335,13 +335,13 @@ def _remove_repair(self) -> None:
335
self.parent.color = 0
336
self.parent.sibling.color = 0
337
338
-
+
339
def check_color_properties(self) -> bool:
340
"""
341
Verify that all Red-Black Tree properties are satisfied:
342
# Root node is black
343
# No two consecutive red nodes (red node cannot have red children)
344
- # All paths from any node to its leaf descendants have
+ # All paths from any node to its leaf descendants have
345
# the same number of black nodes
346
347
Returns:
0 commit comments