题解 | #对称的二叉树# | Golang
对称的二叉树
https://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb
package main
import . "nc_tools"
/*
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
/**
* 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
*
*
* @param pRoot TreeNode类
* @return bool布尔型
*/
func isSymmetrical( pRoot *TreeNode ) bool {
return dfs(pRoot, pRoot)
}
func dfs(one *TreeNode, two * TreeNode) bool {
if one == nil && two == nil {
return true
}
if one == nil || two == nil {
return false
}
return one.Val == two.Val && dfs(one.Right, two.Left) && dfs(one.Left, two.Right)
}
