{"id":"build-tree-uses-leetcode-level-order","text":"`_build_tree` constructs trees from LeetCode's standard level-order serialization format (BFS order with `None` for missing nodes), making test cases directly copy-pasteable from problem examples.","truth_value":"IN","source":"entries/2026/06/06/evaluate-boolean-binary-tree-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-leetcode-level-order","truth_value":"IN","reason":"premise"}]}}