Implement an Iterator over a binary tree with integer values. Your Iterator will be initialized with the root node.

Implement an Iterator over a binary tree with integer values. Your Iterator will be initialized with the root node.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

分类: problem-solving

标签: Apple SWE, Algorithms

目标岗位: Software Engineer

目标公司: Apple

参考答案摘要

解题思路：In-order iterator: push left spine onto stack. next(): pop, then push left spine of right child. hasNext(): stack not empty. Amortized O(1) per op.

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。