class Node: def init(self, value): self.value = value self.left = None self.

ID: 3711448 • Letter: C

Question

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 Trees

Explanation / 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, new_root):

# if the current old tree is not empty

if old_root != None:

# et the value of new_root same as old_root

new_root.value = old.value

# if there is no left child in old_root

if old_root.left == None:

new_root.right = None

else:

# create a temporary node as the right node

new_root.right = Node(1)

# traverse the left subtree

assign_tree( old_root.left , new_root.right )

# if there is no right child in old_root

if old_root.right == None:

new_root.left = None

else:

# create a temporary node as the right node

new_root.left = Node(1)

# traverse the riht subtree

assign_tree( old_root.right , new_root.left )

Navigate

class Node { public: int data; Node * next; }; Node *p1, *p2, *p3; Assume also t

class NodeList { public int item; public NodeList next; public NodeList( int val

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

class Node: def __init__(self, value): self.value = value self.left = None self.

Question

Explanation / Answer

Related Questions

Navigate

class Node: def init(self, value): self.value = value self.left = None self.