Lecture 177:-Two Trees Mirror OR Identical

You can determine whether two trees are mirrors of each other or identical by performing tree traversals and comparing the structures of the trees. In a mirrored relationship, the left subtree of one tree should be the mirror image of the right subtree of the other tree.

Here's a Python implementation to check if two trees are mirrors of each other or identical:

pythonCopy code

class TreeNode: def __init__(self, data): self.data = data self.left = None self.right = None def are_mirror_trees(root1, root2): if root1 is None and root2 is None: return True if root1 is None or root2 is None: return False return (root1.data == root2.data) and \ are_mirror_trees(root1.left, root2.right) and \ are_mirror_trees(root1.right, root2.left) def are_identical_trees(root1, root2): if root1 is None and root2 is None: return True if root1 is None or root2 is None: return False return (root1.data == root2.data) and \ are_identical_trees(root1.left, root2.left) and \ are_identical_trees(root1.right, root2.right) # Example usage tree1 = TreeNode(1) tree1.left = TreeNode(2) tree1.right = TreeNode(3) tree1.left.left = TreeNode(4) tree1.left.right = TreeNode(5) tree2 = TreeNode(1) tree2.left = TreeNode(3) tree2.right = TreeNode(2) tree2.right.left = TreeNode(5) tree2.right.right = TreeNode(4) identical = are_identical_trees(tree1, tree2) if identical: print("The two trees are identical.") else: print("The two trees are not identical.") mirrors = are_mirror_trees(tree1, tree2) if mirrors: print("The two trees are mirrors of each other.") else: print("The two trees are not mirrors of each other.")

In this example, the TreeNode class represents nodes of the binary tree. The are_mirror_trees function checks if two trees are mirrors of each other, while the are_identical_trees function checks if two trees are identical. Both functions use recursive traversal and comparison to determine the relationship between the trees.

The key idea behind are_mirror_trees is that the left subtree of one tree should mirror the right subtree of the other tree, and vice versa.

The are_identical_trees function compares the nodes of the trees and recursively checks the left and right subtrees for identical structures.

Keep in mind that these implementations assume that the trees are binary trees. If you're dealing with more general tree structures (not just binary trees), the logic would need to be adjusted accordingly.