Question: * This question is from Data Structure and Algorithms Subject. QUESTION 1 1. Assume that the nodes have the structure as shown in the figure
* This question is from "Data Structure and Algorithms" Subject. 
QUESTION 1 1. Assume that the nodes have the structure as shown in the figure below: typedef struct node* link; struct node 1 int value; link left; link right; int sumValue (link node Ptr); int findLargest (link nodeptr); int is Positive (link nodeptr); a. Write a recursive function to sum all the values in the tree. b. Write a recursive function to find the largest value in the tree. c. Write a recursive function to determine whether all values in the tree are positive number
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
