/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

6 votes223 views1 answer
Max heap java
Java
0 vote217 views1 answer
Save SQLite returned data to an object list
Java
1 vote227 views1 answer
Java class from string
Java
10 votes241 views2 answers
How to convert string to boolean in java
Java
1 vote209 views1 answer
Java deltaTime
Java
1 vote242 views1 answer
Online java code fixer
Java
0 vote239 views1 answer
Javafx line chaart duplicate series added
Java
0 vote226 views2 answers
Jpa mapping
Java
0 vote230 views1 answer
How to set two different table admin and user for separate jwt token in spring boot
Java Spring
6 votes221 views2 answers
Java get files in directory
Java