Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Consider the following binary tree made up of both positive and negative integers. 5 -15) -8 1 4 10 Our problem is to find the maximum possible sum from one leaf to another in a binary tree. In the example above, the maximum sum is 27 which starts at leaf node 3 and ends at leaf node 10, that is, 3+6+9+0-1 + 10 = 27. a) (6 marks) Outline an algorithm that finds the maximum sum between two leaf nodes using a single traversal of the binary tree. b) Implement (10 marks) and test (4 marks) your algorithm in part a). You may wish to store additional information in each node. c) (4 marks) Augment your code in part b) to return the actual values along the maximum-sum path between the two leaf nodes.

Consider the following binary tree made up of both positive and negative integers. 5 -15) -8 1 4 10 Our problem is to find the maximum possible sum from one leaf to another in a binary tree. In the example above, the maximum sum is 27 which starts at leaf node 3 and ends at leaf node 10, that is, 3+6+9+0-1 + 10 = 27. a) (6 marks) Outline an algorithm that finds the maximum sum between two leaf nodes using a single traversal of the binary tree. b) Implement (10 marks) and test (4 marks) your algorithm in part a). You may wish to store additional information in each node. c) (4 marks) Augment your code in part b) to return the actual values along the maximum-sum path between the two leaf nodes.

C++ Programming: From Problem Analysis to Program Design
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 1TF
See similar textbooks
icon
Related questions
Question

Should be answered using c# 

Consider the following binary tree made up of both positive and negative integers. 5 -15) -8 1 4 10 Our problem is to find the maximum possible sum from one leaf to another in a binary tree. In the example above, the maximum sum is 27 which starts at leaf node 3 and ends at leaf node 10, that is, 3+6+9+0-1 + 10 = 27. a) (6 marks) Outline an algorithm that finds the maximum sum between two leaf nodes using a single traversal of the binary tree. b) Implement (10 marks) and test (4 marks) your algorithm in part a). You may wish to store additional information in each node. c) (4 marks) Augment your code in part b) to return the actual values along the maximum-sum path between the two leaf nodes.
Transcribed Image Text:Consider the following binary tree made up of both positive and negative integers. 5 -15) -8 1 4 10 Our problem is to find the maximum possible sum from one leaf to another in a binary tree. In the example above, the maximum sum is 27 which starts at leaf node 3 and ends at leaf node 10, that is, 3+6+9+0-1 + 10 = 27. a) (6 marks) Outline an algorithm that finds the maximum sum between two leaf nodes using a single traversal of the binary tree. b) Implement (10 marks) and test (4 marks) your algorithm in part a). You may wish to store additional information in each node. c) (4 marks) Augment your code in part b) to return the actual values along the maximum-sum path between the two leaf nodes.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
New Perspectives on HTML5, CSS3, and JavaScript
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS