MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / kthSmallest

Function kthSmallest

javascript/0230-kth-smallest-element-in-a-bst.js:8–12  ·  view source on GitHub ↗
(root, k, inOrder = [])

Source from the content-addressed store, hash-verified

6 * @return {number}
7 */
8var kthSmallest = function (root, k, inOrder = []) {
9 if (!root) return inOrder;
10
11 return dfs(root, k, inOrder);
12};
13
14const dfs = (root, k, inOrder) => {
15 if (root.left) kthSmallest(root.left, k, inOrder);

Callers 1

dfsFunction · 0.70

Calls 2

dfsFunction · 0.70
moveLeftFunction · 0.70

Tested by

no test coverage detected