Same Tree
EasyTreeDepth-First SearchBreadth-First SearchBinary Tree
Solution
import { TreeNode } from '@algorithm/lib';
export function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean {
if (p === null && q === null) {
return true;
}
if (p === null || q === null) {
return false;
}
return p.val === q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
}