mycode 92.44%
# 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 """ def deal(root,level): if not root: self.res[level].append(None) return 0 self.res[level].append(root.val) deal(root.left,level+1) deal(root.right,level+1) from collections import defaultdict self.res = defaultdict (List) # incoming int () function to initialize Deal (root, 0) for Level, Item in self.res.items (): IF not Item == Item [:: - 1 ]: return False return True
reference
# 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 """ def traver(left,right): if not left and not right: return True if not left or not right: return False return (left.val == right.val) and traver(left.left,right.right) and traver(left.right,right.left) return traver(root,root)