classSolution{ funcfindTarget(_root: TreeNode?, _k: Int) -> Bool { var nums = [Int]() funcinOrder(_root: TreeNode?) { if root ==nil { return } inOrder(root?.left) nums.append(root!.val) inOrder(root?.right) } inOrder(root) var l =0, r = nums.count -1, sum =0 while l < r { sum = nums[l] + nums[r] if sum == k { returntrue } if sum > k { r -=1 }else { l +=1 } } returnfalse } }