You are viewing a single comment's thread. Return to all comments →
Java 8
public static int height(Node root) { if(root==null){ return -1; } int left = height(root.left); int right = height(root.right); return Math.max(left, right)+1; }
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Height of a Binary Tree
You are viewing a single comment's thread. Return to all comments →
Java 8