constructor (root) {
        this.stack = [];   /*           | Space O(N) */
        this.getLeft(root);/* Time O(N) | Space O(N)*/
    }
Controlled Recursion - Average Time (1)
Time O(N) | Space O(N)
https://leetcode.com/problems/binary-search-tree-iterator/
@param {TreeNode} root