{"id":"build-tree-level-order-convention","text":"`build_tree` constructs trees from level-order lists (LeetCode's serialization format) using BFS, where `None` entries represent missing nodes — this is the standard tree construction interface across the repo.","truth_value":"IN","source":"entries/2026/06/06/sum-of-root-to-leaf-binary-numbers-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["de-facto-treenode-infra-efficient"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"build-tree-level-order-convention","truth_value":"IN","reason":"premise"}]}}