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