Download Symmetric Tree.py
# Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution(object): def isSymmetric(self, root): """ :type root: TreeNode :rtype: bool """ if root is None: return True return self.mirrorVisit(root.left, root.right) def mirrorVisit(self, left, right): if left is None and right is None: return True try: if left.val == right.val: if self.mirrorVisit(left.left, right.right) and self.mirrorVisit(left.right, right.left): return True return False except: return False
Leetcode 101 Symmetric Tree problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
self.val = x
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.