Code:
public int nodesAtLevel(int n)
{
if(n <0 || isEmpty())
{
return 0;
}
else
{
if( n== 0)
{
if(!(leftChild.isEmpty()) && !(rightChild.isEmpty()))
{
return 2;
}
if(!(leftChild.isEmpty()) || !(rightChild.isEmpty()))
{
return 1;
}
else
{
return 0;
}
}
else
{
return leftChild.nodesAtLevel(n-1) +1 + rightChild.nodesAtLevel(n-1)+1;
}
}
}
Kann da jmd kurz drüberschauen?