/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 vote108 views1 answer
How to preset a list java
Java
1 vote103 views1 answer
Why bufferedreader is faster than scanner
Java
0 vote111 views1 answer
Java plugin spigot messsage console
Java
0 vote99 views1 answer
Java project with submodules
Java
23 votes100 views1 answer
Bootstrap messages red
Java
0 vote97 views1 answer
Join table in where clause criteria in java hibernate
Java
0 vote123 views1 answer
Why enable multidex android
Java
6 votes136 views2 answers
Count the number of words in a string java
Java
0 vote105 views1 answer
Linux mint switch language
Java
4 votes131 views1 answer
Read integer input java
Java