/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 vote340 views1 answer
How to install java jdk 8 on ubuntu 20.04 for spark
Java
5 votes332 views2 answers
Java list of lists
Java
-1 vote342 views1 answer
Load contents of file into string java
Java
1 vote327 views1 answer
Joptionpane.showconfirmdialog yes no example
Java
-2 votes326 views4 answers
How to iterate over JSONObject
Java
0 vote349 views3 answers
Test function that call a function javascrip
Java
0 vote356 views1 answer
Compare integers java sort
Java
1 vote332 views1 answer
Build priority queue
Java
0 vote338 views1 answer
Resultset methods in jdbc
Java
1 vote372 views1 answer
Renardfute
Java