/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

3 votes236 views4 answers
How to make JFrame full screen
Java
-1 vote196 views1 answer
/bin/sh 1 java not found docker
Java
1 vote258 views1 answer
Java how to get elapsedTime
Java
0 vote224 views1 answer
How to compare current date and time with another date and time in android
Java
1 vote188 views1 answer
How do you write or read data from or to file with Java?
Java
-1 vote207 views2 answers
Running Sum of 1d Array
Java
10 votes209 views2 answers
Card view implement
Java
0 vote226 views1 answer
Spring boot send username in email html template
Java Spring
0 vote217 views1 answer
Cosinus-1 java
Java
0 vote196 views2 answers
Downcasting in java
Java