Pleanse answer me for this java cord. Thanks

#What is the output produced by the following?

public static void cheers(int n) {

if (n <= 1)

System.out.println("Hurrah");

else {

System.out.println("Hip");

cheers(n-1);

}

}

##Using the method inorderPrint in IntBTNode.java (also shown below) as an example, implement the method int sum() which sums all the items in a tree.

public class IntBTNode {

private int data;

private IntBTNode left, right;

}

public void inorderPrint() {

if (left != null)

left.inorderPrint();

System.out.println(data);

if (right != null)

right.inorderPrint();

##Assume StrBTNode is defined as below, write a method boolean search(String target) to search the binary tree to determine if a string exists in the tree.

public class StrBTNode {

private String data;

private IntBTNode left, right;

}

public boolean search(String target) {

}