kthSmallest

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @param {number} k
 * @return {number}
 */
var kthSmallest = function(root, k) {
    k = k - 1; // zero-index k
    var smallestValue;
    var path = [];
    
    var goDown = function(root) {
        while (root.left !== null) {
            root = root.left;
            path.push('left');
        }
    }
    
    var getNextSmallest = function(root, k, currentSmallestIndex) {
        if (k === currentSmallest) {
            return;
        }
        var currentNode = getCurrentNode(root, path);
        
        
    }
    
    var getCurrentNode = function(root, path) {        
        for (var i = path.length - 1; i >= 0; --i) {
            var operation = path[i];
            if (operation === 'left') {
                root = root.left;
            } else {
                root = root.right;
            }
        }
        
        return root;
    }
    
    
    goDown(root);
    getNextSmallest(root, k, 0);
    
    return smallestValue;
};