Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
dfs solution in Clear category for Tree Walker by imloafer
def tree_walker(tree, target):
# your code here
if tree == target:
return 1
counter = 0
if isinstance(tree, dict):
tree = list(tree.values())
else:
tree = list(tree)
while tree:
node = tree.pop()
if node == target:
counter += 1
if isinstance(node, list|tuple):
tree += list(node)
if isinstance(node, dict):
tree += list(node.values())
return counter
if __name__ == '__main__':
print("Example:")
print(tree_walker([1, "2", 3, [[3], 1, {1: "one"}]], 1))
# These "asserts" are used for self-checking and not for an auto-testing
assert tree_walker([1, "2", 3, [[3], 1, {1: "one"}]], 1) == 2, "1st"
assert tree_walker({"one": 1, "two": [{1: "one", 2: "two"}, 1, "1", "one"]}, 1) == 2, "2nd"
assert tree_walker({"one": [1, 2], "two": [{1: "one", 2: "two"}, [1, 2], "1", "one"]}, [1, 2]) == 2, "3rd"
assert tree_walker(5, 5) == 1, "4th"
assert tree_walker([5, 6, 2, "1"], 1) == 0, "5th"
assert tree_walker([[dict()], [[[3], [3, 5]]], [], []], 3) == 2, "6th"
assert tree_walker([{1: "one"}, {2: "two"}, "two", ["two", {"two": "one"}]], "two") == 3, "7th"
print("Coding complete? Click 'Check' to earn cool rewards!")
Dec. 5, 2022
Comments: