Answered step by step
Verified Expert Solution
Question
1 Approved Answer
) Assume the following definition for a node of a binary tree. public class Node { public int data; public Node left; public Node right;
- ) Assume the following definition for a node of a binary tree.
public class Node { public int data; public Node left; public Node right; public Node(int d) { data = d; left = null; right = null; } }
|
- Write a recursive function sum(Node root) which calculates and returns the sum of the data values in all the nodes of the binary tree rooted at the given root node.
public static int sum(Node root) {
} |
b. Consider the following recursive function:
public static void fun(int a, int b, int c) { int d = 3 (b + c); if(a > 1) fun(a-1, b, d); System.out.println(a + " " + b + " " + c); if(a > 1) fun(a-1, d, c); } |
What is the output generated by calling fun(3, 2, 1)?
Answer:
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started