Hackerrank - Utopian Tree

    static int utopianTree(int n) {
        
        int h = 0;
        
        for(int i = 0; i <= n; i++){
            if(i==0){
                h = 1;
                continue;
            }
            if(i % 2 == 1){
                h *= 2;
            }else{
                h += 1;
            }
        }
        return h;
    }