{"id":"closest-value-bst-ordering-assumed","text":"The directional pruning (`left if target < node.val else right`) is only correct for valid BSTs; a non-BST input silently produces wrong results with no validation.","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-bst-ordering-assumed","truth_value":"IN","reason":"premise"}]}}