[LeetCode]题解(python):101 Symmetric tree

Posted loadofleaf

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode]题解(python):101 Symmetric tree相关的知识,希望对你有一定的参考价值。

题目来源


https://leetcode.com/problems/symmetric-tree/

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).


题意分析


Input:一个二叉树

Output:True or False

Conditions: 判断一个二叉树是不是对称的


题目思路


一一对应判断值是否相等,注意要清楚谁对应谁。


AC代码(Python)

 1 # Definition for a binary tree node.
 2 # class TreeNode(object):
 3 #     def __init__(self, x):
 4 #         self.val = x
 5 #         self.left = None
 6 #         self.right = None
 7 
 8 class Solution(object):
 9     def isSymmetric(self, root):
10         """
11         :type root: TreeNode
12         :rtype: bool
13         """
14         def help(p, q):
15             if p == None and q == None:
16                 return True
17             if p and q and p.val == q.val:
18                 return help(p.left, q.right) and help(p.right, q.left)
19             return False
20         
21         if root:
22             return help(root.left, root.right)
23         return True
24         

 

以上是关于[LeetCode]题解(python):101 Symmetric tree的主要内容,如果未能解决你的问题,请参考以下文章

精选力扣500题 第64题 LeetCode 101. 对称二叉树c++/java详细题解

LeetCode 双周赛 101,DP/中心位贪心/裴蜀定理/Dijkstra/最小环

leetcode-101-对称二叉树

LeetCode101. 对称二叉树

LeetCode101. 对称二叉树

[LeetCode&Python] Problem 101. Symmetric Tree