type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
var current, res int
func kthLargest(root *TreeNode, k int)int{
current, res =0,0dfs(root, k)return res
}
func dfs(root *TreeNode, k int){if root == nil {return}dfs(root.Right, k)if k == current {return}
current++if k == current {
res = root.Val
}dfs(root.Left, k)}