I’m aiming google/fb london/zurich. The problem is to create an iterator for binary search tree. To solve this problem I’ve implemented morris traversal but it’s a bit tricky algo so took a lot of time to debug and make all testcases pass. Am i so far behind the hiring bar?

comments
This is the difference between theory and practical application. Do it the normal way and use a stack like a real person.
I have to disagree on most code won't compile part. I'm guessing your main language is Java or Cpp, that is fine for those languages. However, there shouldn't be any bugs in the code to get a good rating.
You can get away with a bad interview if others were strong though
I doubt even google ask this. Are you experienced?
Search, array, binary tree search etc.