Skip to content

Commit b6d8373

Browse files
committed
Fix formatting.
1 parent a476b38 commit b6d8373

File tree

1 file changed

+4
-3
lines changed

1 file changed

+4
-3
lines changed

algorithms/binary_tree.py

+4-3
Original file line numberDiff line numberDiff line change
@@ -129,7 +129,7 @@ def compare_trees(self, node):
129129
else:
130130
res = self.right.compare_trees(node.right)
131131
return res
132-
132+
133133
def print_tree(self):
134134
"""
135135
Print tree content inorder
@@ -147,7 +147,7 @@ def tree_data(self):
147147
# we use a stack to traverse the tree in a non-recursive way
148148
stack = []
149149
node = self
150-
while stack or node:
150+
while stack or node:
151151
if node:
152152
stack.append(node)
153153
node = node.left
@@ -167,4 +167,5 @@ def children_count(self):
167167
cnt += 1
168168
if self.right:
169169
cnt += 1
170-
return cnt
170+
return cnt
171+

0 commit comments

Comments
 (0)