728x90
반응형
[LeetCode - Daily Challenge] 653. Two Sum IV - Input is a BST

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given the root of a Binary Search Tree and a target number k, return true if there exist two elements in the BST such that their sum is equal to the given target. Example 1: Input: root = [5,3,6,2,4,null,7], k = 9 Output: trueExample 2: Input: root = [5,3,6,2,4,null,7], k = 28 Output: falseExample 3: Input: root = [2,1,3], k = 4 Output: trueExample 4: Input: ..
Algorithm/LeetCode Daily Challenge 2021. 8. 24. 10:30
728x90
반응형
1