{"id":"closest-value-o-h-time-o1-space","text":"`closestValue` visits at most one node per tree level via iterative BST-directed search, making it O(h) time and O(1) space (no recursion stack).","truth_value":"IN","source":"entries/2026/06/06/closest-binary-search-tree-value-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"closest-value-o-h-time-o1-space","truth_value":"IN","reason":"premise"}]}}