https://oj.leetcode.com/problems/binary-search-tree-iterator/
next() and hasNext() run in average O(1) time and uses O(h) memory, where h is the height of the tree.
283 ms time cost.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
https://oj.leetcode.com/problems/binary-search-tree-iterator/
next() and hasNext() run in average O(1) time and uses O(h) memory, where h is the height of the tree.
283 ms time cost.