/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

14 votes356 views2 answers
String array java for month
Java
103 votes418 views4 answers
How to convert int to string java
Java
0 vote363 views1 answer
Enum type spring boot entity
Java
0 vote428 views1 answer
Log errors with stack traces spring
Java Spring
0 vote329 views1 answer
Write a method multiply() in a class Arithmetic
Java
2 votes333 views1 answer
System.arraycopy
Java
0 vote342 views1 answer
Java schleifendurchläufe zählen
Java
0 vote369 views1 answer
Larger number in java than long
Java
2 votes354 views1 answer
> Task :run FAILED Error: Could not find or load main class Caused by: java.lang.ClassNotFoundException:
Java
0 vote356 views1 answer
How to change tablayout current view position in android
Java