[swift] LeetCode 100. Same Tree

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

if let p = p, let q = q {
    return p.val == q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right)
} else {
    return p == nil && q == nil
}

if let p = p, let q = q {

return p.val == q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right)

} else {

return p == nil && q == nil

}

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版