Iterative Solution || Easiest || Faster than 95% Solutions
\nclass Solution:\n    def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:\n        n=0\n        stack=[]\n        cur=root\n        while cur or st
```\nclass Solution:\n    def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:\n        n=0\n        stack=[]\n        cur=root\n        while cur or stack :\n            while cur :\n                stack.append(cur)\n                cur=cur.left\n            cur=stack.pop()\n            n +=1\n            if n==k :\n                return cur.val\n            cur = cur.right\n```\nDo upvote if its helpful,Thanks.
['Stack', 'Python']