Package g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1022 - Sum of Root To Leaf Binary Numbers\.

    Easy

    You are given the root of a binary tree where each node has a value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit.

    • For example, if the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary, which is 13.

    For all leaves in the tree, consider the numbers represented by the path from the root to that leaf. Return the sum of these numbers.

    The test cases are generated so that the answer fits in a 32-bits integer.

    Example 1:

    Input: root = 1,0,1,0,1,0,1

    Output: 22

    Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22

    Example 2:

    Input: root = 0

    Output: 0

    Constraints:

    • The number of nodes in the tree is in the range [1, 1000].

    • Node.val is 0 or 1.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer sumRootToLeaf(TreeNode root)

      • Methods inherited from class java.lang.Object

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