0100-same-tree.ts

/**
 * Definition for a binary tree node.
 * class TreeNode {
 * val: number
 * left: TreeNode | null
 * right: TreeNode | null
 * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
 * this.val = (val===undefined ? 0 : val)
 * this.left = (left===undefined ? null : left)
 * this.right = (right===undefined ? null : right)
 * }
 * }
 */

functionisSameTree(p: TreeNode|null,q: TreeNode|null): boolean{
if(p===null&&q===null)returntrue;

if((p===null&&q!==null)||(p!==null&&q===null))returnfalse;

letleftSame=isSameTree(p.left,q.left);
letrightSame=isSameTree(p.right,q.right);

if(p.val===q.val&&leftSame&&rightSame){
returntrue;
}

returnfalse;
}