{"id":"build-tree-uses-level-order","text":"`build_tree` deserializes LeetCode's bracket/level-order format using a FIFO queue (`list.pop(0)`), assigning left then right children per node; `None` entries represent absent children.","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":"build-tree-uses-level-order","truth_value":"IN","reason":"premise"}]}}