https://leetcode.cn/problems/two-sum-iv-input-is-a-bst https://leetcode.cn/problems/opLdQZ

Author: masx200

README.md

@@ -620,6 +620,10 @@ https://leetcode.cn/problems/increasing-order-search-tree/
 
 https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/
 
+https://leetcode.cn/problems/two-sum-iv-input-is-a-bst
+
+https://leetcode.cn/problems/opLdQZ
+
 #### 安装教程
 
 1. 安装`deno`

opLdQZ/index.ts

@@ -0,0 +1 @@
+export { default } from "../two-sum-iv-input-is-a-bst/index.ts";

two-sum-iv-input-is-a-bst/index.ts

@@ -0,0 +1,8 @@
+import inorderTraversal from "../binary-tree-inorder-traversal/index.ts";
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+import twoSum from "../two-sum-ii-input-array-is-sorted/index.ts";
+
+export default function findTarget(root: TreeNode | null, k: number): boolean {
+    const list = inorderTraversal(root);
+    return twoSum(list, k)[0] >= 1;
+}