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) {

}