/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 vote133 views1 answer
Java digit in number
Java
0 vote132 views1 answer
Mobile network ip address permission android
Java
1 vote156 views1 answer
Java calculate elapsedTime
Java
0 vote131 views1 answer
How to pass a float between activities in android studio
Java
0 vote126 views1 answer
Difference between maven plugin and dependency
Java
0 vote131 views1 answer
Uri/Beecrowd problem no - 1146 solution in Java
Java
0 vote141 views1 answer
How to install clojure on linux
Java
0 vote130 views1 answer
How to convert errorBody to pojo in retrofit
Java
0 vote139 views1 answer
Jdk
Java
0 vote157 views1 answer
Print a letter in java
Java