/Java/Counting nodes in binary search tree

Counting nodes in binary search tree

    public int countNode(Node root){

        //base case
        if(root==null)
            return 0;

        //recursive call to left child and right child and
        // add the result of these with 1 ( 1 for counting the root)
        return 1 + countNode(root.left) + countNode(root.right);
    }

Source: algorithms.tutorialhorizon.com

Similar codes

1 vote180 views1 answer
How to change color of radio button in android
Java
1 vote150 views1 answer
Circular list java
Java
1 vote150 views1 answer
Recompile with -Xlint:deprecation
Java
0 vote156 views1 answer
How to get cpu model number in android programmatically
Java
-2 votes151 views1 answer
How to saperate string to array
Java
0 vote149 views1 answer
Buscando Objeto do Array
Java
1 vote201 views1 answer
How to find selenium webelement java
Java
2 votes146 views1 answer
Create a java exception
Java
0 vote156 views2 answers
Finding the ASCII value of a Character in java
Java
-1 vote157 views1 answer
Java swing change label icon
Java