Leetcode 1022. Sum of Root To Leaf Binary Numbers

Given a binary tree with node values 0 or 1, interpret each root-to-leaf path as a binary number (root is the most significant bit) and return the sum of all those numbers. This is a tree-traversal problem (e.g., DFS) that accumulates bit-values along each path; the result fits in a 32-bit integer.