LeetCode: Kth Smallest Element in a BST Solution

Approach

Get the k-th element from result of inorder traversal

Implementation

1var kthSmallest = function (root, k) {
2  const traversed = []
3
4  const recursion = node => {
5    if (!node) return
6    recursion(node.left)
7    traversed.push(node.val)
8    recursion(node.right)
9  }
10
11  recursion(root)
12
13  return traversed[k - 1]
14}

References

Original problem

Similar problems

Binary Tree Inorder Traversal

Second Minimum Node In a Binary Tree