Question

java please

IV. Given a pointer to a binary tree write a routine which will traverse the tree and return the 59 and 112 number of nodes in the tree whose information field which is an integer is between In addition return the value of the node with the largest integer and as well return a count or the number of nodes that have no sons. For the 3rd part do not include nodes that have both right and left sons as well as do not include any nodes that have only a right or nodes that just have a left son.

Answer 1

class Node {
int data;
Node left, right;
  
public Node(int data)
{
this.data = data;
left = right = null;
}
}
  
class BinaryTree {
Node root;
  
// Returns the count of all value in range 59-112(both inclusive) in a binary tree
public int findrange(Node node)
{
if (node == null)
return 0;
if (node.data>=59 && node.data<=112) {
   return 1+findrange(node.left) +findrange(node.right) ;
}
else return findrange(node.left) +findrange(node.right) ;
  
}
  
// Returns the maximum value in a binary tree
public int findMax(Node node)
{
if (node == null)
return Integer.MIN_VALUE;
  
int max = node.data;
int lmax = findMax(node.left);
int rmax = findMax(node.right);
  
if (lmax > max)
max = lmax;
if (rmax > max)
max = rmax;
return max;
}
// Returns the count of leaf node in a binary tree
public int LeafCount(Node node)
{
if (node == null)
return 0;
if (node.left == null && node.right == null)
return 1;
else
return LeafCount(node.left) + LeafCount(node.right);
}
}