剑指 Offer 28. 对称的二叉树

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

递归的比较左右

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func isSymmetric(root *TreeNode) bool {
    if root == nil {
        return true
    } else {
        return doRecursion(root.Left, root.Right)
    }
}

func doRecursion(l, r *TreeNode) bool {
    if l == nil && r == nil {
        return true
    } else if l == nil || r == nil || l.Val != r.Val {
        return false
    } else {
        return doRecursion(l.Left, r.Right) && doRecursion(l.Right, r.Left)
    }
}