simple recursion (functional) clear solution for Tree Walker by juestr - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

simple recursion (functional) solution in Clear category for Tree Walker by juestr

def tree_walker(tree, target):
    return tree == target or sum(tree_walker(child, target) for child in
        (tree if isinstance(tree, list) else tree.values() if isinstance(tree, dict) else []))

Jan. 16, 2020

Comments:

Marcin_Ramotowski on Aug. 3, 2021, 8:17 a.m.
<p>Nice. :)</p>

lisovsky on Feb. 2, 2023, 10:22 p.m.
<p>Excellent recursive algorithm. I've looked at a lot of solutions, but I haven't seen any shorter.</p>

Rock

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.