LeetCode Same Tree (golang)

Problem

Analysis Process
Recursion
1.Determines whether the value of the current node is equal
2.Recursively determines whether left and right subtrees are equal

Code

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func isSameTree(p *TreeNode, q *TreeNode) bool {

    if p== nil && q == nil{       //Determines whether the current two trees are empty
        return true
    }

    if p != nil && q == nil || p ==nil && q != nil{     //one tree is empty ,the other is not
        return false
    }

    if p.Val != q.Val{              //Determines whether the values of two nows are eqaul
        return false
    }
    return isSameTree(p.Left,q.Left) && isSameTree(p.Right,q.Right)
    // Recursively determines whether left and right subtrees are equal
}