Java Program to Count the number of nodes and leaf nodes of Binary Tree

package com.test;

classNode<T>{
      T data;
      Node<T> leftChild;
      Node<T> rightChild;

publicNode(T item){
this.data= item;
           leftChild =null;
           rightChild =null;
}
}

publicclassBSTNodeCount<T>{

      Node<T> root;
int count =0;

intgetNodeCount(){

returngetNodeCount(root);
}

intgetNodeCount(Node<T> node){
if(node ==null){
return0;
}else{
                count =1;
                count+= getNodeCount(node.leftChild);
                count+= getNodeCount(node.rightChild);
}
return count;
}


publicstaticvoidmain(String[] args){

             BSTNodeCount<Integer> tree =new BSTNodeCount<Integer>();
             tree.root=new Node<Integer>(10);
             tree.root.leftChild=new Node<Integer>(2);
             tree.root.rightChild=new Node<Integer>(15);

             System.out.println("Total Number of nodes in a BST :-"+tree.getNodeCount());
}
}

package com.test;

classNode<T>{
      T data;
      Node<T> leftChild;
      Node<T> rightChild;

publicNode(T item){
this.data= item;
           leftChild =null;
           rightChild =null;
}
}
publicclassBSTLeafNodeCount<T>{

       Node<T> root;
intgetLeafNodeCount(){
returngetLeafNodeCount(root);
       }

intgetLeafNodeCount(Node<T> node){
if(node ==null){
return0;
}
if(node.leftChild==null&& node.rightChild==null){
return1;
}else{
returngetLeafNodeCount(node.leftChild)+ getLeafNodeCount(node.rightChild);
}
}

publicstaticvoidmain(String[] args){

              BSTLeafNodeCount<Integer> tree =new BSTLeafNodeCount<Integer>();
              tree.root=new Node<Integer>(1);
              tree.root.rightChild=new Node<Integer>(2);
              tree.root.leftChild=new Node<Integer>(5);
              tree.root.rightChild.leftChild=new Node<Integer>(1);

              System.out.println("Total Number of Leaf Nodes in a BST:-"+tree.getLeafNodeCount());
}
}