【力扣剑指 Offer 54. 二叉搜索树的第k大节点】dfs直接返回(python3)

题目描述

https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/

思路题解

dfs直接返回法

class Solution:
    def kthLargest(self, root: TreeNode, k: int) -> int:
        def dfs(root):
            nonlocal k
            if not root:return 0
            r=dfs(root.right)
            k-=1
            if k==0:return root.val
            l=dfs(root.left)
            return l^r
        return dfs(root)

dfs利用self直接返回

class Solution:
    def kthLargest(self, root: TreeNode, k: int) -> int:
        def dfs(root):
            if not root: return
            dfs(root.right)
            if self.k == 0: return
            self.k -= 1
            if self.k == 0: self.res = root.val
            dfs(root.left)

        self.k = k
        dfs(root)
        return self.res