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 92cfae7 commit b065964Copy full SHA for b065964
data_structures/binary_tree/diff_views_of_binary_tree.py
@@ -106,7 +106,6 @@ def depth_first_search(
106
depth_first_search(root, 0, left_view)
107
return left_view
108
109
-
110
def binary_tree_top_side_view(root: TreeNode) -> list[int]:
111
r"""
112
Function returns the top side view of binary tree.
@@ -173,8 +172,6 @@ def binary_tree_bottom_side_view(root: TreeNode) -> list[int]:
173
172
>>> binary_tree_bottom_side_view(None)
174
[]
175
"""
176
- from collections import defaultdict
177
178
def breadth_first_search(root: TreeNode, bottom_view: list[int]) -> None:
179
180
A breadth first search traversal with defaultdict ds to append
0 commit comments