/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 vote152 views1 answer
Fast Search in java
Java
2 votes146 views1 answer
Write an infinite loop java
Java
0 vote167 views1 answer
Java application running other app
Java
64 votes155 views6 answers
Get last element of array java
Java
0 vote184 views1 answer
Missing artifact com.sun.jersey:jersey-servlet:jar:1.20-SNAPSHOT
Java
1 vote146 views1 answer
Context error in android studio
Java
0 vote139 views1 answer
How to delete character certain index in java
Java
2 votes188 views1 answer
Java lambda foreach multiple statements
Java
0 vote154 views1 answer
Spring boot MVC config
Java Spring
34 votes142 views6 answers
Top wishlisted games on steam
Java