/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

11 votes207 views4 answers
Convert arraylist to array in java
Java
0 vote237 views1 answer
On selected item changed listview javafx
Java
1 vote201 views6 answers
Roblox.com
Java
0 vote204 views1 answer
Java to python
Java
0 vote185 views1 answer
How to run the war file in Apache Tomcat/8.5.59 THROUGH SPRING
Java
0 vote192 views1 answer
Meditation for stress and depression
Java
3 votes207 views1 answer
WHAT IS JRE
Java
0 vote188 views1 answer
Spring webflux
Java
0 vote214 views2 answers
Spring boot base url
Java
0 vote216 views1 answer
Docer file spring boot
Java Spring