/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

1 vote126 views1 answer
How to see list of java of versions in mac
Java
2 votes128 views1 answer
Will my java minecraft be discontinued
Java
16 votes129 views4 answers
Java add values to array
Java
0 vote146 views1 answer
Kafkalistener annotation pass topic from properties file
Java
1 vote139 views1 answer
Comparable
Java
0 vote124 views1 answer
Sort a list according to location
Java
0 vote131 views3 answers
Bf5 cheat detector
Java
0 vote141 views1 answer
Bad notification for startForeground: java.lang.RuntimeException: invalid channel for service notification: Notification
Java
12 votes149 views1 answer
Get certain character from string java
Java
1 vote131 views1 answer
Java the local variable may not have been initialized
Java