How should I practice Sum Root-to-Leaf Binary Numbers?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Oracle phone screen problems in FastPrep.

Is Sum Root-to-Leaf Binary Numbers associated with Oracle?

FastPrep tags this as a Oracle phone screen coding practice problem when the problem catalog has that company and stage context.

Oracle● EasyFULLTIMEPHONE SCREEN

You are given the root of a binary tree whose node values are 0 or 1.

Each root-to-leaf path represents a binary number, with the root as its most significant bit. Return the sum of all represented numbers.

A leaf is a node with no children.

sumRootToLeaf(root: TreeNode) → int

root = [1,0,1,0,1,0,1]return = 22

The four paths represent 100, 101, 110, and 111, which sum to 22.

root = [0]return = 0

The only path represents zero.

root = [1]return = 1

The only path represents one.