"""
https://practice.geeksforgeeks.org/problems/find-a-pair-with-given-target-in-bst/

Given a Binary Search Tree and a target sum.
Check whether there's a pair of Nodes in the BST with value summing up to the target sum.

Example 1:

Input:
        2
      /   \
     1     3
sum = 5
Output: 1
Explanation:
Nodes with value 2 and 3 sum up to 5.
"""


class BinaryTreeNode:
    def __init__(self, data=None, left=None, right=None):
        self.data = data
        self.left = left
        self.right = right


def kth_largest():
    pass


def main():
    pass


if __name__ == '__main__':
    main()
