package com.github.masx200.leetcode_test.er_cha_sou_suo_shu_de_di_kda_jie_dian_lcof

Author: masx200

er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/index.kt

@@ -0,0 +1,26 @@
+package com.github.masx200.leetcode_test.er_cha_sou_suo_shu_de_di_kda_jie_dian_lcof
+
+import com.github.masx200.leetcode_test.insert_into_a_binary_search_tree.TreeNode
+
+class Solution {
+    fun kthLargest(root: TreeNode?, k: Int): Int {
+
+        reverseInOrderIterator(root).forEachIndexed { i, v ->
+            if (i + 1 == k) return v
+
+        }
+        throw Error("unreachable")
+    }
+
+}
+
+fun reverseInOrderIterator(root: TreeNode?): Sequence<Int> {
+    return sequence {
+
+        if (root == null) return@sequence
+
+        yieldAll(reverseInOrderIterator(root.right))
+        yield(root.`val`)
+        yieldAll(reverseInOrderIterator(root.left))
+    }
+}

pom.xml

@@ -88,6 +88,7 @@
                             <sourceDirs>
                                 <sourceDir>construct-binary-search-tree-from-preorder-traversal</sourceDir>
                                 <source>er-cha-shu-ran-se-UGC</source>
+                                <source>er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof</source>
                                 <source>utils</source>
                                 <source>add-two-integers</source>
                                 <source>design-skiplist</source>

test/com/github/masx200/leetcode_test/er_cha_sou_suo_shu_de_di_kda_jie_dian_lcof/SolutionTest.kt

@@ -0,0 +1,14 @@
+package com.github.masx200.leetcode_test.er_cha_sou_suo_shu_de_di_kda_jie_dian_lcof
+
+import com.github.masx200.leetcode_test.utils.TreeNodeLeetCodeParse
+import org.junit.jupiter.api.Assertions.assertEquals
+import org.junit.jupiter.api.Test
+
+internal class SolutionTest {
+
+    @Test
+    fun testkthLargest() {
+        assertEquals(4, Solution().kthLargest(TreeNodeLeetCodeParse("[5,3,6,2,4,null,null,1]"), 3))
+        assertEquals(4, Solution().kthLargest(TreeNodeLeetCodeParse(" [3,1,4,null,2]"), 1))
+    }
+}