You are viewing a single comment's thread. Return to all comments →
Java 8, O(log n)
public static int height(Node root) { if (root == null) { return -1; } else { return 1 + Math.max(height(root.left), height(root.right)); } }
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, O(log n)