python3

Write a recursive function, leaf change, which takes a tree t, a value old and a value new. Your function returns an updated tree which is the same as the original t, except that every leaf with value equal to old is substituted with value new. def leaf_change(t, old, new): Returns an updated tree which is the sane as the original t,except that every leaf with value equal to old is replaced with a new value treeltree(4) print treelleat change(treel, 3, 4)) dreans tree("dreans treel Laptop, tree "sony), tree asus")1), tree("phone", tree("sony")) tree("car", sree("lexus"), reel"arda")1) print treelleaf change(d reans, "sony", "apple")) dreans Laptop apple -PS apple lexus nazda