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

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/
+
 https://leetcode.cn/problems/numbers-at-most-n-given-digit-set/
 
 https://leetcode.cn/problems/er-cha-shu-ran-se-UGC/

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

@@ -0,0 +1,21 @@
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
+function kthLargest(root: TreeNode | null, k: number): number {
+    let i = 1;
+    for (const v of reverseInOrderIterator(root)) {
+        if (i === k) return v;
+        i++;
+    }
+    throw Error("unreachable");
+}
+export function* reverseInOrderIterator(
+    root: TreeNode | null,
+): Generator<number> {
+    if (!root) {
+        return;
+    }
+    yield* reverseInOrderIterator(root.right);
+    yield root.val;
+    yield* reverseInOrderIterator(root.left);
+}
+export default kthLargest;

mod.ts

@@ -9,6 +9,7 @@ import { parseComplex } from "./complex-number-multiplication/parse_complex.ts";
 import { buildBST } from "./convert-sorted-list-to-binary-search-tree/buildBST.ts";
 import { PrefixTreeInsert } from "./design-add-and-search-words-data-structure/PrefixTreeInsert.ts";
 import { DoublyLinkedList } from "./design-linked-list/DoublyLinkedList.ts";
+import { reverseInOrderIterator } from "./er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/index.ts";
 import { ArrayToCircularDoublyTreeList } from "./er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/ArrayToCircularDoublyTreeList.ts";
 import { NestedIntegerFrom } from "./flatten-nested-list-iterator/NestedIntegerFrom.ts";
 import { deduplication } from "./fraction-addition-and-subtraction/deduplication.ts";
@@ -155,6 +156,7 @@ export {
     ArrayToCircularDoublyTreeList,
     getVariable,
     InOrderIterator,
+    reverseInOrderIterator,
     ScopeList,
     traverseInOrder,
     UnionFind,