Status: IN
The algorithm visits each node exactly once via in-order traversal, giving O(n) time and O(h) stack space where h is tree height.
Source: entries/2026/06/06/increasing-order-search-tree-solution.md
JSON