We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 7310514 commit 78f0d9dCopy full SHA for 78f0d9d
data_structures/binary_tree/binary_search_tree.py
@@ -40,7 +40,7 @@ def __reassign_nodes(self, node: Node, new_children: Node | None) -> None:
40
else:
41
node.parent.left = new_children
42
43
- self.root = None
+ self.root = new_children
44
45
def is_right(self, node: Node) -> bool:
46
if node.parent and node.parent.right:
0 commit comments