394. Binary Tree Path Sums

Given the root of a binary tree represented as a list in level-order (where null represents a missing node), return the sum of all values in the tree. If the tree is empty, return 0.

Example:
Input: root = [1, 2, 3] Output: 6

Run this challenge interactively in Python or JavaScript when the app loads.