How to implement an lazy iterator for a binary tree in Depth First Pre-Order

Question

I need to implement an lazy Iterator for a binary tree so that it traverses the tree in Depth First Pre-Order fashion.

I am struggling in even thinking of a solid strateg