/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

2 votes249 views1 answer
Greater than sign in java
Java
15 votes276 views10 answers
Hello world
Java
16 votes258 views2 answers
Java how to reverse an array
Java
0 vote301 views2 answers
@embeddedid
Java
0 vote301 views1 answer
Picked up _JAVA_OPTIONS: -Xmx256M intillij
Java
0 vote290 views1 answer
Java tree from star
Java
1 vote266 views1 answer
Java static variable
Java
0 vote275 views1 answer
Get distance from latitude and longitude code android
Java
0 vote282 views1 answer
Armstrong Numbers Between Two Integers
Java
0 vote292 views1 answer
Stringbuilser
Java