Binary Search Tree Iterator

Implement hasNext and next methods for in-order traversal. Track the current node pointer while maintaining O(h) extra memory in this Apple problem.

Check more interview questions and experiences about Apple

Please log in to view interview question details