Code you provide 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 fromthe node to all descendant leaves. The function should return O 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']}%3D# 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 a leaf is given and return an error message if the node/leaf doesn't exist. Jse your function and print the output for nodes: 17, 15, 13, 9, 2

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. Jse your function and print the output for nodes: 17, 15, 13, 9, 2

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Write a recursive function that, given a sequence of comparable values, returns the count of elements where the current element is less than the following ( next ) element in the given sequence. See the examples given below. def count_ordered ( seq ) : """ Input : A sequence of comparable elements Output : The number of elements that are less than the following element in the sequence Example : >>> count_ordered ( [ 1 , 2 , 3 , 4 , 5 , 6 ] ) 5 >>> count_ordered ( ( 1 , 12, 7.3 , -2,4 ) ) 2 >>> count_ordered ( 'Python' ) 2 >>> count_ordered ( [ 6 ] ) 0 >>> count_ordered ( [ ] ) 0 """ In the first example above , count_ordered ( [ 1,2,3,4,5,6 ] )the returned answer is 5 because for all the first 5 numbers the current number is less than the next number. In the second example above, count_ordered ( ( 1,12,7.3 , -2,4 ) )the…
C++, Write a recursion function that counts the positive elements multiple of 5 in a binary search tree and counts the elements less than 0 and multiple of 2, then returns the two counts multiplied to the main.Note that you have to write only one function and you can add parameters to the function as needed
part 1. draw the recursive call tree for the following function when its called with a(7) int a (int n) { if (n % 4== 0) { return n+1;} else { return a(n-1) + a (n*4); } } part 2. what is the returning value?
B) Write a recursive function to find summation of the first n positive numbers (for example, if n=5 then summation of 1+2+3+4+5=15). Then, trace its execution by showing stack contents.
python code Write a recursive function such that, given a list of intergers (say v) and an integer value (say x), the function returns resulting subset if there is a subset of intergers in v that sum up to x. Otherwise the function returns an empty list; Also write a sample code that runs this function using an example list and value x, and state the expected result
Write a function in a racket code that takes as input a list of elements and returns a list with elements and their position after. For example, if the input to the function is (list ’a ’b ’c) then it will return (list a 1 b 2 c 3). Make sure to use recursion
in C programing Write a recursive function that returns 1 if an array of size n is in sorted order and 0 otherwise. Note: If array a stores 3, 6, 7, 7, 12, then isSorted(a, 5) should return 1 . If array b stores 3, 4, 9, 8, then isSorted(b,4) should return 0.int isSorted(int *array, int n){
For function decToBinary, write the missing parts of the recursion case. This function should return a string that stores the binary equivalent for int variable num. Example: The binary equivalent of 13 may be found by repeatedly dividing 13 by 2. So, 13 in base 2 is represented by the string "1101". Examples: decToBinary(13) -> "1101" public String decToBinary (int num) { if (num < 2) return Integer.toString(num); else return <<Missing recursive call>> + <<Missing calculation>>;}
Write and test a recursive function max to find the largest number in a list.The max is the larger of the first item and the max of all the other items.
write a python function that will return the leaves of a binary tree with (t) being the root of the binary tree. the function must use recursion Starting code: def leaves(t): return [t.key]
Write a recursive Racket function "update-if" that takes two functions, f and g, and a list xs as parameters and evaluates to a list. f will be a function that takes one parameter and evaluates true or false. g will be a function that takes one parameter and evaluates to some output. The result of update-if should be a list of items such that if x is in xs and (f x) is true, then (g x) is in the list. The output list's elements should keep the input list's items in the same relative order. For example (update-if even? add1 '(1 2 3 4)) should evaluate to '(3 5) because 2 and 4 make even? true and add1 turns 2 and 4 into 3 and 5.
Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given list. For example: mylist=[1,2,3,4] Multiply2(mylist) prints: 2 4 6 8