173. Binary Search Tree Iterator - Unsolved

# Definition for a  binary tree node
class TreeNode(object):
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class BSTIterator(object):
    def __init__(self, root):
        """
        :type root: TreeNode
        """
        # stack stores all left nodes
        self.stack = []
        while root:
            self.stack.append(root)
            root = root.left
        
        
        
    # @return a boolean, whether we have a next smallest number
    def hasNext(self):
        """
        :rtype: bool
        """
        
        return len(self.stack) > 0
        
    
    # @return an integer, the next smallest number
    def next(self):
        """
        :rtype: int
        """
        
        # node is the left leaf from bottom 
        node = self.stack.pop()
        x = node.right
        while x:
            self.stack.append(x)
            x = x.left
        return node.val
        
        
        

# Your BSTIterator will be called like this:
# i, v = BSTIterator(root), []
# while i.hasNext(): v.append(i.next())