Count of leave nodes in Binary Tree

LeaveNodeCount.java

class Node {

    int data;
    Node left, right;

    public Node(int item) {
        data = item;
        left = right = null;
    }
}

class BinaryTree {

    Node root;

    public void printleaveNode() {
      System.out.println(" Leave Node Count: " + leaveNode(root));
    }
    
    public int leaveNode(Node root){
        
        if(root==null){
            return 0;
        }
        
        if(root.left == null && root.right == null ) {
            return 1;
        }
        
        return leaveNode(root.left) + leaveNode(root.right);
    }
    
    public static void main(String args[]) {
        
        BinaryTree tree = new BinaryTree();
        tree.root = new Node(1);
        tree.root.left = new Node(2);
        tree.root.right = new Node(3);
        tree.root.left.left = new Node(4);
        tree.root.left.right = new Node(5);
        tree.printleaveNode();
    }
}