https://leetcode.cn/problems/leaf-similar-trees

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/leaf-similar-trees
+
 https://leetcode.cn/problems/find-the-town-judge
 
 https://leetcode.cn/problems/buddy-strings

leaf-similar-trees/index.ts

@@ -0,0 +1,28 @@
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
+function leafSimilar(root1: TreeNode | null, root2: TreeNode | null): boolean {
+    const seq1: number[] = [];
+    if (root1) {
+        dfs(root1, seq1);
+    }
+
+    const seq2: number[] = [];
+    if (root2) {
+        dfs(root2, seq2);
+    }
+    return seq1.toString() === seq2.toString();
+}
+
+function dfs(node: TreeNode, seq: number[]) {
+    if (!node.left && !node.right) {
+        seq.push(node.val);
+    } else {
+        if (node.left) {
+            dfs(node.left, seq);
+        }
+        if (node.right) {
+            dfs(node.right, seq);
+        }
+    }
+}
+export default leafSimilar;