剑指 Offer 28. 对称的二叉树
/**
* 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
}
return double(root.Left,root.Right)
}
func double(Left,Right *TreeNode)bool{
//递归出口
if Left == nil && Right == nil{
return true
}
//判断条件
if Left == nil || Right == nil || Left.Val != Right.Val{
return false
}
//递归调用
return double(Left.Left,Right.Right) && double(Left.Right,Right.Left)
}