Suppose you have the following BTNode for a binary tree in Java.

class BTNode { int info;

BTNode left;

BTNode right;

}

Part A: Write a recursive method to count number of leaves in a binary tree. The root node is given as the parameter of the method. The method header is provided below. A leaf node is a node that does not have any children.

public int countLeaves(BTNode root) { 

}

Part B: Write a recursive method to verify if a binary tree is a binary search tree. The root node is given as the parameter of the method. The method header is provided below.

public boolean isBST(BTNode root) { 

} 

Part C: Write a recursive method to print all the info numbers in a binary tree in ascending order assuming that the given binary tree is a binary search tree.

public void printAscending(BTNode root) { 

}