首发于 语雀文档@blueju

    代码：

    1. /**
    2.  * Definition for a binary tree node.
    3.  * class TreeNode {
    4.  *     val: number
    5.  *     left: TreeNode | null
    6.  *     right: TreeNode | null
    7.  *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
    8.  *         this.val = (val===undefined ? 0 : val)
    9.  *         this.left = (left===undefined ? null : left)
    10.  *         this.right = (right===undefined ? null : right)
    11.  *     }
    12.  * }
    13.  */
    15. function kthSmallest(root: TreeNode | null, k: number): number {
    16.     let order = []
    17.     root.left && dfs(root.left)
    18.     order.push(root.val)
    19.     root.right && dfs(root.right)
    20.     console.log(order)
    21.     return order[k-1]
    23.     function dfs(root: TreeNode) {
    24.         root.left && dfs(root.left)
    25.         order.push(root.val)
    26.         root.right && dfs(root.right)
    27.     }
    28. };