class Solution: # 返回对应节点TreeNode def KthNode(self, root, k): if root==None or k==0: return None res=[] def Mid(node): if len(res)>=k or node==None: return None Mid(node.left) res.append(node) Mid(node.right) Mid(root) if len(res)<k: return None else: return res[k-1]