【力扣剑指 Offer 28. 对称的二叉树】递归（Python3）

题目描述

https://leetcode-cn.com/problems/dui-cheng-de-er-cha-shu-lcof/

思路题解

相当于分两个指针，分别遍历。一个中左右，一个中右左
https://leetcode-cn.com/problems/dui-cheng-de-er-cha-shu-lcof/solution/mian-shi-ti-28-dui-cheng-de-er-cha-shu-di-gui-qing/

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def isSymmetric(self, root: TreeNode) -> bool:
        def recur(L, R):
            if not L and not R: return True
            if not L or not R or L.val != R.val: return False
            return recur(L.left, R.right) and recur(L.right, R.left)

        return recur(root.left, root.right) if root else True

还可以直接中序遍历一遍，结果保存在数组，判断数组是否对称。注意空节点要单独输出一下。