{"id":"increasing-bst-linear-time","text":"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.","truth_value":"IN","source":"entries/2026/06/06/increasing-order-search-tree-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"increasing-bst-linear-time","truth_value":"IN","reason":"premise"}]}}