text: """This problem was asked by Google.
  
  Given the root of a binary search tree, and a target K, return two nodes in the tree whose sum equals K.
  
  For example, given the following tree and K of 20
  
      10
     /   \
   5      15
         /  \
       11    15
  Return the nodes 5 and 15.
  """