/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 vote240 views1 answer
Split number java
Java
1 vote233 views1 answer
Javax.xml.bind does not exist
Java
0 vote252 views1 answer
Spring db properties
Java Spring
0 vote241 views1 answer
Java object class
Java
56 votes226 views6 answers
String remove last character
Java
0 vote230 views1 answer
How to make a text field required in android studio
Java
10 votes222 views3 answers
How to change default port in spring boot
Java
3 votes244 views1 answer
How to append character at first position in stringbuilder java
Java
0 vote244 views1 answer
Javacal
Java
0 vote255 views1 answer
Cosinus-1 java
Java