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.
//Write your code hereintleftNode=0;intrightNode=0;if(root.left!=null){leftNode=getHeight(root.left)+1;}if(root.right!=null){rightNode=getHeight(root.right)+1;}returnMath.max(leftNode,rightNode);
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Day 22: Binary Search Trees
You are viewing a single comment's thread. Return to all comments →
My 2 cents in Java: