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 c3e01dd commit cc78688Copy full SHA for cc78688
binary-tree-level-order-traversal/pmjuu.py
@@ -32,5 +32,3 @@ def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
32
result.append(same_level_nodes)
33
34
return result
35
-
36
0 commit comments