পাইথনে দুটি ট্রি নোড স왪 করায় সমান হয় কিনা যাচাই করা (Flip Equivalent Trees)

পাইথন কোড

class TreeNode:
    def __init__(self, data, left=None, right=None):
        self.val = data
        self.left = left
        self.right = right

class Solution:
    def solve(self, root0, root1):
        que1, que2 = [root0], [root1]
        while que1 and que2:
            temp1, temp2 = [], []
            values1, values2 = [], []
            if len(que1) != len(que2):
                return False
            for i in range(len(que1)):
                values1.append(que1[i].val)
                values2.append(que2[i].val)
                # Tree 0: Flip simulation (Right first, then Left)
                if que1[i].right:
                    temp1.append(que1[i].right)
                if que1[i].left:
                    temp1.append(que1[i].left)
                # Tree 1: Normal
                if que2[i].right:
                    temp2.append(que2[i].right)
                if que2[i].left:
                    temp2.append(que2[i].left)
            if values1 != values2 and values1 != values2[::-1]:
                return False
            que1, que2 = temp1, temp2
        return True

# টেস্ট
ob = Solution()
root = TreeNode(2, None, TreeNode(4, TreeNode(3), TreeNode(5)))
root1 = TreeNode(2, TreeNode(4, TreeNode(3), TreeNode(5)), None)
print(ob.solve(root, root1))  # True

টাইম কমপ্লেক্সিটি: O(n), স্পেস: O(w) (w = ম্যাক্সimum-width)। এটি লিটকোড "Flip Equivalent Binary Trees" সমস্যা।