LeetCode129 Sum Root to Leaf Numbers

详细见：leetcode.com/problems/sum-root-to-leaf-numbers

Java Solution: github

package leetcode;

import java.util.LinkedList;
import java.util.Queue;

import tools.TreeNode辅助;

/*
 * 	Given a binary tree containing digits from 0-9 only, 
 * 	each root-to-leaf path could represent a number.
	
	An example is the root-to-leaf path 1->2->3 which represents the number 123.
	
	Find the total sum of all root-to-leaf numbers.
	
	For example,
	
	    1
	   / \
	  2   3
	The root-to-leaf path 1->2 represents the number 12.
	The root-to-leaf path 1->3 represents the number 13.	
	Return the sum = 12 + 13 = 25.
 */

import tools.TreeNode辅助.TreeNode;

public class P129_SumRoottoLeafNumbers {
	public static void main(String[] args) {
		TreeNode t = Tre