/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 vote176 views1 answer
Java code to get all leaf nodes of a xml file
Java
-2 votes153 views2 answers
How to use beacon power in minecraft in java edition
Java
0 vote199 views2 answers
Kotlin dependency injection
Java
0 vote180 views1 answer
How to change text of textview in slide menu bar header android
Java
1 vote189 views1 answer
Hashtable contains key java
Java
-5 votes202 views1 answer
Android studio get time
Java
14 votes273 views2 answers
String array java for month
Java
0 vote198 views1 answer
Java catch stop signal
Java
0 vote186 views1 answer
Java to kotlin converter android studio
Java
0 vote216 views2 answers
How to calculate min, max and average and write the output into into a text file in java
Java