We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
publicstaticintutopianTree(intn){// Write your code hereintheight=1;intcount=0;if(n==0)return1;while(count<n){height+=height;count++;if(count<n){height+=1;count++;}}returnheight;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Utopian Tree
You are viewing a single comment's thread. Return to all comments →
Java Solution