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 14fde9b commit 8aa6bd5Copy full SHA for 8aa6bd5
datastructures/trees/binary/node.py
@@ -40,7 +40,7 @@ def __init__(
40
self.right: Optional[BinaryTreeNode] = right
41
# Next is a pointer that connects this node to it's right sibling in the tree. If this node is the right most
42
# node on a given level, then it is connected to the first node on the next level. If this node is the last node
43
- # in the tree on the last node, then it is pointed to None. By default, it is set to None.
+ # in the tree on the last level, then it is pointed to None. By default, it is set to None.
44
# Note that if this is the root node, it is connected to the left most node on the next level.
45
self.next: Optional[BinaryTreeNode] = next
46
0 commit comments