[JAVA] BinaryTree height

public class BinaryTree2 {

    BinaryTree baum = new BinaryTree(7);
    BinaryTree lbaum = new BinaryTree(4);
    BinaryTree llbaum = new BinaryTree(5);
    BinaryTree lrbaum = new BinaryTree(9);
    BinaryTree rbaum = new BinaryTree(9);
    BinaryTree rlbaum = new BinaryTree(2);
    BinaryTree rrbaum = new BinaryTree(8);
    BinaryTree rrrbaum = new BinaryTree(8);
    BinaryTree rrrrbaum = new BinaryTree(8);



    int zähler=0;
    int zähler2=0;
    int zähler3=0;
    int höhegesamt=0;

   public BinaryTree2()
   {
        lbaum.setLeftTree(llbaum);
        lbaum.setRightTree(lrbaum);
        rbaum.setLeftTree(rlbaum);
        rbaum.setRightTree(rrbaum);
        rrbaum.setRightTree(rrrbaum);
        rrrbaum.setRightTree(rrrrbaum);
        baum.setLeftTree(lbaum);
        baum.setRightTree(rbaum);
        System.out.println(""+hoehe(lbaum));
        System.out.println(""+hoehe(rbaum));
   }

    public int hoehe(BinaryTree pTree){

        if(!pTree.getLeftTree().isEmpty()){
            zähler++;
            hoehe(pTree.getLeftTree());

        }
        if(!pTree.getRightTree().isEmpty()){
            zähler++;
            hoehe(pTree.getRightTree());

        }
        if(pTree.getRightTree().isEmpty()&&pTree.getLeftTree().isEmpty()){
            if(zähler>=höhegesamt){
                höhegesamt=zähler+1;

        }
            zähler=0;
        }
        return höhegesamt;

    }



}