Conversation
|
Your solution for BSTIterator is excellent. It correctly implements the iterator with the required time and space complexity. The code is clean and easy to understand. However, note that the problem only asks for the BSTIterator implementation. Including solutions for other problems in the same file might be confusing and is not necessary. In the future, ensure that you only submit the code relevant to the problem at hand. One minor suggestion: the dfs method could be renamed to something more descriptive, like pushAllLeft, to make it clear that it pushes all left children onto the stack. This is a common naming convention in such solutions. Overall, great job on the BSTIterator implementation. |
|
No specific feedback provided. Refer to GitHub Comment. |
2 participants
No description provided.