{"id":"inorder-bst-yields-sorted","text":"The minimum-distance-between-bst-nodes solution relies on in-order traversal visiting BST nodes in ascending value order, reducing the problem to adjacent-pair difference comparison.","truth_value":"IN","source":"entries/2026/06/06/minimum-distance-between-bst-nodes-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"inorder-bst-yields-sorted","truth_value":"IN","reason":"premise"}]}}