Bug Report for binary-search-tree-iterator

[iamef]

Bug Report for https://neetcode.io/problems/binary-search-tree-iterator

Please describe the bug below and include any steps to reproduce the bug or screenshots if possible.

Time complexity for next and hasNext should be O(1)

For solutions

1. Flattening the BST (DFS) and 2. Flatten the BST (Iterative DFS)

[iamef]

Also the video linked for that problem should be https://www.youtube.com/watch?v=RXy5RzGF5wo not the one that's on there