Linked-List-2 Done

[Sreeja-99]

No description provided.

[super30admin]

• Strengths: The solution correctly implements the BST Iterator functionality and follows the expected approach using a stack for in-order traversal. The code is readable and well-structured.
• Areas for Improvement:
  • Replace the recursive dfs method with an iterative one to avoid potential stack overflow and improve efficiency.
  • Ensure that the next() method handles edge cases gracefully, such as when the stack is empty (though the problem states next() calls will always be valid).
  • Consider adding comments to explain the logic more clearly, especially for the dfs method.