1. 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; }

}

1. Write a recursive function height(Node root) which calculates and returns the height of the binary tree rooted at the given root node.

public static int height(Node root) {

}

2. 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, 0, 2)?

Answer: