Write a recursive function that will calculate the height of a binary tree.

Note: root1 and root2 are instances of the class BinNode:

public class BinNode {

public char value; public BinNode left; public BinNode right;

}

Thus, the following statements would lead to the underlined output:

Example 1: System.out.println( treeHeight (root1) );

3

Example 2: System.out.println( treeHeight (root2) );

1

Please write your method on the following page.

public static int treeHeight (BinNode current)

uestion 3 10 marks Recursion: write a recursive function that height tree. will calculate the of a binary root D root 2. Note: root1 and root2 are instances of the class BinNode: public class BinNode public char value