/** * Definition for a binary tree node. */ Practice 1 public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. Note: A leaf is a node with no children. Example: Given the below binary tree and sum = 22, class TreeDFS { public boolean hasPathSum(TreeNode root, int sum) { 5 4 8 } 11 13 4 /\ \ 7 2 1 return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Topic Video
Question

Please answer the question in the screenshot. The language used here is Java. Please use the starting code. 

 

/ **
* Definition for a binary tree node.
* /
public class TreeNode {
int val;
Practice 1
Given a binary tree and a sum,
determine if the tree has a root-to-leaf
path such that adding up all the values
along the path equals the given sum.
Note: A leaf is a node with no children.
TreeNode left;
TreeNode right;
TreeNode (int x) { val = x; }
}
Example: Given the below binary tree
and sum = 22,
class TreeDFS {
%3D
5
public boolean hasPathSum(TreeNode root, int sum) {
}
}
4 8
11 13 4
7 2
1
return true, as there exist a
root-to-leaf path 5->4->11->2 which
sum is 22.
Transcribed Image Text:/ ** * Definition for a binary tree node. * / public class TreeNode { int val; Practice 1 Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. Note: A leaf is a node with no children. TreeNode left; TreeNode right; TreeNode (int x) { val = x; } } Example: Given the below binary tree and sum = 22, class TreeDFS { %3D 5 public boolean hasPathSum(TreeNode root, int sum) { } } 4 8 11 13 4 7 2 1 return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Instruction Format
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education