Implement deep_map, which takes a function with f applied to any element within link f and...

Transcribed Image Text:

Implement deep_map, which takes a function with f applied to any element within link f and a link. It returns a new linked list with the same structure as link, but any Link instance contained in link. The deep_map function should recursively apply fn to each of that Link 's elements rather than to that Link itself. Hint: You may find the built-in isinstance function useful. def deep_map (f, link): """Return a Link with the same structure as link but with fn mapped over its elements. If an element is an instance of a linked list, recursively apply f inside that linked list as well. >>>s = Link (1, Link(Link (2, Link(3)), Link(4))) >>>print_link(s) <1 <2 3> 4> >>>print link (deep_map (lambda x: x* x, s)) <1 <4 9> 16> >>>print_link (s) # unchanged <1 <2 3> 4> >>> t = Link (s, Link (Link (Link (5)))) >>> print_link (t) < <1 <2 3> 4> < <5>>> >>> print link (deep_map (lambda x: 2 * x, t)) < <2 <4 6> 8> < <10>>> "*** YOUR CODE HERE ***" Implement deep_map, which takes a function with f applied to any element within link f and a link. It returns a new linked list with the same structure as link, but any Link instance contained in link. The deep_map function should recursively apply fn to each of that Link 's elements rather than to that Link itself. Hint: You may find the built-in isinstance function useful. def deep_map (f, link): """Return a Link with the same structure as link but with fn mapped over its elements. If an element is an instance of a linked list, recursively apply f inside that linked list as well. >>>s = Link (1, Link(Link (2, Link(3)), Link(4))) >>>print_link(s) <1 <2 3> 4> >>>print link (deep_map (lambda x: x* x, s)) <1 <4 9> 16> >>>print_link (s) # unchanged <1 <2 3> 4> >>> t = Link (s, Link (Link (Link (5)))) >>> print_link (t) < <1 <2 3> 4> < <5>>> >>> print link (deep_map (lambda x: 2 * x, t)) < <2 <4 6> 8> < <10>>> "*** YOUR CODE HERE ***"