Method getLeft

javascript/0173-binary-search-tree-iterator.js:26–32

* Time O(N) | Space O(H) * @return {number}

(root, { stack } = this)

     * @return {number}
     */
    getLeft(root, { stack } = this) {
        while (root !== null) {
            /* Time O(N) */
            stack.push(root); /* Space O(N) */
            root = root.left;
        }
    }

    /**
     * Time O(N) | Space O(N)