題目描述:
代碼實現:
- 遞歸法,三個判斷語句後遞歸到左右節點即可。
- 時間複雜度:O(n)
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} p
* @param {TreeNode} q
* @return {boolean}
*/
var isSameTree = function(p, q) {
if (p === null && q === null)
return true
if (p === null || q === null)
return false
if(p.val !== q.val)
return false
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right)
};