# Question

Formatted question description: https://leetcode.ca/all/1214.html

 Given two binary search trees,
return True if and only if
there is a node in the first tree and a node in the second tree whose values sum up to a given integer target.

Example 1:
2     1
/ \   / \
1   4 0   3

Input: root1 = [2,1,4], root2 = [1,0,3], target = 5
Output: true
Explanation: 2 and 3 sum up to 5.

@tag-array


# Algorithm

Get two ordered list, and 2 pointers to move forward for each.

Java