Answered step by step
Verified Expert Solution
Question
1 Approved Answer
class Node: def __init__(self, value): self.value = value self.left = None self.right = None def mirrorTree(root): new_root = Node(root.value) assign_tree(root, new_root) return new_root def assign_tree(old_root,
class Node: def __init__(self, value): self.value = value self.left = None self.right = None def mirrorTree(root): new_root = Node(root.value) assign_tree(root, new_root) return new_root def assign_tree(old_root, new_root): # this helper will recursively assign the left subtree # of old_root to be the right subtree of new_root # and assign the right subtree of old_root to be the # left subtree of new_root
Problem Complete the function mirrorTree () to take in a root node of a tree and return another copy of the tree that is a mirror of the original one. Your function cannot modify the tree that is passed in This will require you to use a helper function with recursion. I have already gotten you started with the helper. An example of a mirrored tree is shown below: 2 2 3 5 4 4 Mirror TreesStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started