{"id":"bit-shift-accumulation-correctness","text":"`(current << 1) | node.val` correctly builds a binary number MSB-first, equivalent to `current * 2 + node.val` — used in tree and linked-list path-to-number problems.","truth_value":"IN","source":"entries/2026/06/06/sum-of-root-to-leaf-binary-numbers-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"bit-shift-accumulation-correctness","truth_value":"IN","reason":"premise"}]}}