How to Count nodes in Binary Tree ?

[Harshini]

Hello friends,

I want to find the total number of nodes in a binary tree structure at the same time i also need the the leftside and right side separately.I try to find over the Internet but didn't got a Solution.

Can anyone help me out with this.

Intel Core 2 Duo 2.8 Ghz
G31 Asrock Motherboard with Intel chipset
2gb RAM
256 Nvidia Graphic Card
200gb HDD

[Masters]

Sure i will help you out with this issue before going ahead may i know which programming language are you using it.

[Harshini]

I am using Java as my Programming language.


Intel Core 2 Duo 2.8 Ghz
G31 Asrock Motherboard with Intel chipset
2gb RAM
256 Nvidia Graphic Card
200gb HDD
Edit/Delete Message

[Masters]

Try to use this code i assume that you node class will work.

public static <T> int nodesAtFirstKLevels(BTNode<T> root, int k)
{
    if (root == null || k<=0)
    {
      return 0;
    } else {
        return 1 + count(root.left,k-1) + count(root.right,k-1);
    }
  }
}

[Aabhas]

If you want it very simple you can use this too.

public static <T> int nodesAtFirstKLevels(BTNode<T> root, int k)
{
        return (root == null || k<=0) ? 0: (1 + count(root.left,k-1) + count(root.right,k-1));
}