Ideas
算法:递归
数据结构:二叉搜索树
根据二叉搜索树的性质使用中序遍历将所有节点的值保存到一个数组
遍历完成之后会得到一个有序的数组
从而将问题转换成两数之和的问题
Code
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def findTarget(self, root: TreeNode, k: int) -> bool:
self.nums = []
def in_order(node):
if not node:
return
in_order(node.left)
self.nums.append(node.val)
in_order(node.right)
in_order(root)
L, R = 0, len(self.nums) - 1
while L < R:
if self.nums[L] + self.nums[R] > k: R -= 1
elif self.nums[L] + self.nums[R] < k: L += 1
else: return True
return False