forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.ts
25 lines (25 loc) · 819 Bytes
/
Solution.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
/**
* 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)
* }
* }
*/
type TreeNodeOptional = TreeNode | null;
const isSame = (a: TreeNodeOptional, b: TreeNodeOptional): boolean => {
if (!a && !b) return true;
if (!a || !b) return false;
return (
a.val === b.val && isSame(a.left, b.right) && isSame(a.right, b.left)
);
};
var isSymmetric = function (root: TreeNode | null): boolean {
if (!root) return true;
return isSame(root.left, root.right);
};