you give root binary tree node value 0 1 each roottoleaf path represent binary number start significant bitFor example path 0 1 1 0 1 represent 01101 binary 13For leave tree consider number represent path root leaf Return sum numbersthe test case generate answer fit 32bits integer Example 1input root 1010101output 22explanation 100 101 110 111 4 5 6 7 22example 2input root 0output 0 constraintsthe number nod tree range 1 1000nodeval 0 1