leetcode---剑指offer056.二叉搜索树中两个节点之和

中序遍历得到二叉搜索树的递增序列，然后用两数之和的思想即可：

class Solution:
    def findTarget(self, root: TreeNode, k: int) -> bool:
        temp=[]
        def mid_order(node):
            if node==None:
                return
            mid_order(node.left)
            temp.append(node.val)
            mid_order(node.right)
        mid_order(root)
        h=set()
        for i in temp:
            if k-i in h:
                return True
            h.add(i)
        return False