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.
because they return 1 + max(root.left+root.right) now if root.left or root.right were null then max(blah blah) will return -1 and together they would return 0 as height of that root without left or right subtree..
my solution
static int h=0;
static int t = 0;
static int[] a = new int[40];
static int i=0;
public static int height(Node root) {
// Write your code here.
a[i] = root.data;
i++;
if(root!=null)
{
if(root.left!=null)
{
h++;
height(root.left);
}
if(root.right!=null)
{
h++;
height(root.right);
}
if(root.left==null&&root.right==null)
{
if(h>t)
t = h;
}
Tree: Height of a Binary Tree
You are viewing a single comment's thread. Return to all comments →
NO. they haven't mentioned that in the problem. but in editorial they return -1 for root == Null because:
because they return
1 + max(root.left+root.right)now ifroot.leftorroot.rightwere null then max(blah blah) will return-1and together they would return 0 as height of that root without left or right subtree..Yes, you are right;
orelse, it return the height+1
Seriously, who solved the problem without looking reading discussion?
me
my solution static int h=0; static int t = 0; static int[] a = new int[40]; static int i=0; public static int height(Node root) { // Write your code here. a[i] = root.data; i++; if(root!=null) {
if(root.left!=null) { h++; height(root.left); } if(root.right!=null) { h++;
height(root.right); } if(root.left==null&&root.right==null) { if(h>t) t = h; }
I solved it :)