Write a recursive function that calculates the sum of the branch lengths given a tree and node number. The function should return the sum of all branches leading from the node to all descendant leaves. The function should return 0 if leaf is given and return an error message if the node/leaf doesn't exist. Use your function and print the output for nodes: 17, 15, 13, 9, 2 tree3 = { 15: ['N', {'node': 14, 'branch': 0.1}, {'node': 12, 'branch': 0.3}], 14: ['N', {'node': 13, 'branch': 0.2}, {'node': 1, 'branch': 1.5}], 13: ['N', {'node': 11, 'branch': 0.3}, {'node': 9, 'branch': 0.4}], 12: ['N', {'node': 10, 'branch': 0.3}, {'node': 8, 'branch': 0.7}], 11: ['N', {'node': 2, 'branch': 0.25}, {'node': 3, 'branch': 0.35}], 10: ['N', {'node': 6, 'branch': 0.1}, {'node': 7, 'branch': 0.12}], 9: ['N', {'node': 4, 'branch': 0.02}, {'node': 5, 'branch': 0.08}], 8: ['L'], } 7: ['L'], 6: ['L'], 5: ['L'], 4: ['L'], 3: ['L'], 2: ['L'], 1: ['L'] # Answer def sumbranch (tree, node): return "answer" print( sumbranch (tree3, 17) ) print( sumbranch (tree3, 15)) print( sumbranch (tree3, 13)) print( sumbranch (tree3, 9)) print( sumbranch (tree3, 2) ) answer answer answer answer answer
Write a recursive function that calculates the sum of the branch lengths given a tree and node number. The function should return the sum of all branches leading from the node to all descendant leaves. The function should return 0 if leaf is given and return an error message if the node/leaf doesn't exist. Use your function and print the output for nodes: 17, 15, 13, 9, 2 tree3 = { 15: ['N', {'node': 14, 'branch': 0.1}, {'node': 12, 'branch': 0.3}], 14: ['N', {'node': 13, 'branch': 0.2}, {'node': 1, 'branch': 1.5}], 13: ['N', {'node': 11, 'branch': 0.3}, {'node': 9, 'branch': 0.4}], 12: ['N', {'node': 10, 'branch': 0.3}, {'node': 8, 'branch': 0.7}], 11: ['N', {'node': 2, 'branch': 0.25}, {'node': 3, 'branch': 0.35}], 10: ['N', {'node': 6, 'branch': 0.1}, {'node': 7, 'branch': 0.12}], 9: ['N', {'node': 4, 'branch': 0.02}, {'node': 5, 'branch': 0.08}], 8: ['L'], } 7: ['L'], 6: ['L'], 5: ['L'], 4: ['L'], 3: ['L'], 2: ['L'], 1: ['L'] # Answer def sumbranch (tree, node): return "answer" print( sumbranch (tree3, 17) ) print( sumbranch (tree3, 15)) print( sumbranch (tree3, 13)) print( sumbranch (tree3, 9)) print( sumbranch (tree3, 2) ) answer answer answer answer answer
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
Related questions
Question
Please provide a thorough code in python
![Write a recursive function that calculates the sum of the branch lengths given a tree and node number. The function should return the sum of all branches
leading from the node to all descendant leaves. The function should return 0 if a leaf is given and return an error message if the node/leaf doesn't exist.
Use your function and print the output for nodes: 17, 15, 13, 9, 2
tree3
=
{
15: ['N', {'node': 14, 'branch': 0.1}, {'node': 12,
'branch': 0.3}],
14: ['N', {'node': 13, 'branch': 0.2}, {'node': 1, 'branch': 1.5}],
13: ['N', {'node': 11, 'branch': 0.3}, {'node': 9, 'branch': 0.4}],
12: ['N', {'node': 10, 'branch': 0.3}, {'node': 8,
'branch': 0.7}],
11: ['N', {'node': 2, 'branch': 0.25}, {'node': 3, 'branch': 0.35}],
10: ['N', {'node': 6, 'branch': 0.1}, {'node': 7, 'branch': 0.12}],
9: ['N', {'node': 4, 'branch': 0.02}, {'node': 5, 'branch': 0.08}],
8: ['L'] "
7: ['L'],
6: ['L'],
5: ['L'],
4: [L "
3: ['L'],
2: ['L'],
1: ['L']
#Answer
def sumbranch (tree, node):
return answer
answer
answer
answer
answer
answer
"1
print sumbranch (tree3, 17) )
print sumbranch (tree3, 15))
print sumbranch(tree3, 13))
print sumbranch (tree3, 9))
print sumbranch (tree3, 2) )](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F183197c4-4ed3-4535-8fe2-afbff38e7abd%2Fa44ea1b0-6e83-4e5f-a391-6d907a2281e3%2F0y0tar_processed.png&w=3840&q=75)
Transcribed Image Text:Write a recursive function that calculates the sum of the branch lengths given a tree and node number. The function should return the sum of all branches
leading from the node to all descendant leaves. The function should return 0 if a leaf is given and return an error message if the node/leaf doesn't exist.
Use your function and print the output for nodes: 17, 15, 13, 9, 2
tree3
=
{
15: ['N', {'node': 14, 'branch': 0.1}, {'node': 12,
'branch': 0.3}],
14: ['N', {'node': 13, 'branch': 0.2}, {'node': 1, 'branch': 1.5}],
13: ['N', {'node': 11, 'branch': 0.3}, {'node': 9, 'branch': 0.4}],
12: ['N', {'node': 10, 'branch': 0.3}, {'node': 8,
'branch': 0.7}],
11: ['N', {'node': 2, 'branch': 0.25}, {'node': 3, 'branch': 0.35}],
10: ['N', {'node': 6, 'branch': 0.1}, {'node': 7, 'branch': 0.12}],
9: ['N', {'node': 4, 'branch': 0.02}, {'node': 5, 'branch': 0.08}],
8: ['L'] "
7: ['L'],
6: ['L'],
5: ['L'],
4: [L "
3: ['L'],
2: ['L'],
1: ['L']
#Answer
def sumbranch (tree, node):
return answer
answer
answer
answer
answer
answer
"1
print sumbranch (tree3, 17) )
print sumbranch (tree3, 15))
print sumbranch(tree3, 13))
print sumbranch (tree3, 9))
print sumbranch (tree3, 2) )
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education