/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

0 vote134 views1 answer
How to check the current user in firebase android
Java
1 vote159 views1 answer
Java for schleife
Java
4 votes210 views1 answer
Select a random element from a list java
Java
-1 vote172 views1 answer
Mysql connection details in springboot
Java Spring
24 votes140 views6 answers
Arrays in java
Java
0 vote145 views1 answer
No Java executable found in current PATH: /bin:/usr/bin:/sbin:/usr/sbin
Java
3 votes128 views1 answer
How to add cardview in android studio
Java
0 vote142 views1 answer
How to save rich text format in database using java
Java
23 votes131 views6 answers
String to char
Java
0 vote146 views1 answer
Java namespaces
Java