Leetcode: Sum Root to Leaf Numbers_leetcode

Source: Internet
Author: User

Given a binary tree containing digits to 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.

Given a binary tree, the path from the root node to the leaf node represents an integer, and all paths and

Solution Idea: DFS

Code:

 public class Solution {public int sumnumbers (TreeNode root) {if (root = null) {return 0;
    Return Dfs (root, 0); private int Dfs (TreeNode root, int sum) {if (Root.left = = NULL && Root.right = null) {R
        Eturn sum * + root.val;

        int result = 0;
        if (root.left!= null) {result = DFS (root.left, sum * + root.val);
        } if (root.right!= null) {result = DFS (root.right, sum * + root.val);
    return result; }
}

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.