/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 vote295 views1 answer
Directory size java
Java
0 vote290 views1 answer
Hashmaps java
Java
1 vote295 views1 answer
How to maximize a web page
Java
0 vote279 views1 answer
List of BigInteger to list of long
Java
0 vote306 views1 answer
Alphabet n vowelin java
Java
0 vote301 views1 answer
Grepper editor
Java
1 vote294 views1 answer
Java lombok constructor inject guice
Java
0 vote309 views1 answer
Hide steam games from friends
Java
0 vote281 views1 answer
How to know if a file is iso-8859-1 encoded in java
Java
0 vote324 views1 answer
How to compare between to char array java
Java