Package g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers

Class Solution

java.lang.Object

g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers.Solution

public class Solution
extends Object

1022 - Sum of Root To Leaf Binary Numbers.<p>Easy</p> <p>You are given the <code>root</code> of a binary tree where each node has a value <code>0</code> or <code>1</code>. Each root-to-leaf path represents a binary number starting with the most significant bit.</p> <ul> <li>For example, if the path is <code>0 -> 1 -> 1 -> 0 -> 1</code>, then this could represent <code>01101</code> in binary, which is <code>13</code>.</li> </ul> <p>For all leaves in the tree, consider the numbers represented by the path from the root to that leaf. Return <em>the sum of these numbers</em>.</p> <p>The test cases are generated so that the answer fits in a <strong>32-bits</strong> integer.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/04/04/sum-of-root-to-leaf-binary-numbers.png" alt="" /></p> <p><strong>Input:</strong> root = [1,0,1,0,1,0,1]</p> <p><strong>Output:</strong> 22</p> <p><strong>Explanation:</strong> (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> root = [0]</p> <p><strong>Output:</strong> 0</p> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in the tree is in the range <code>[1, 1000]</code>.</li> <li><code>Node.val</code> is <code>0</code> or <code>1</code>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	sumRootToLeaf(TreeNode root)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

sumRootToLeaf

public int sumRootToLeaf(TreeNode root)