二叉搜索树的第K个结点（剑指offer62）

/* function TreeNode(x) {
    this.val = x;
    this.left = null;
    this.right = null;
} */
function KthNode(pRoot, k)
{
    let stack = []
    let result = []
    let current = pRoot
    while(current || stack.length){
        if(current){
            stack.push(current)
            current = current.left
        }else{
            current = stack.pop()
            result.push(current)
            if(result.length == k){
                return result[k-1]
            }
            current = current.right
        }
    }
}
module.exports = {
    KthNode : KthNode
};