Find the Maximum Depth or Height of a Tree | GeeksforGeeks 

YES

How come?

He's following 1st convention

@@rishabhsharma667 is there is a different

@@rishabhsharma667 The root node has depth zero, leaf nodes have height zero, and a tree with only a single node (hence both a root and leaf) has depth and height zero. Conventionally, an empty tree (tree with no nodes, if such are allowed) has height −1.

The first convention has a lot more sense. Is more logical. Even when we graphically represent the tree, it has A LOT more sense the first convention.

@@reiniergarcia height implies some kind of length. when we measure length, for eg 3 units on a scale, we never count the point 0 on the scale. idk how the 1st convention makes more "sense", however the 0 convention is more consistent with the definition of length as we know it.

Thanks abhirup banerjee!

yeah bro i am also having the same doubt so what is correct?

Thanks Ahmet Cevahir ÇINAR :)

just print final return of called function

Since we iterate over all the nodes for calculating the height, the time complexity is O(n)

@@DjRoshSydney it depends becoz O(n) for worst case and O(log2n) for perfect binary tree

@@shubhamshinde5643 no its always O(n). Regardless what the tree is like, you always have to traverse every node in order to know the depth because you wouldn't know its a perfect binary tree.

same doubt

@@saranshupadhyay3123 because the function executes else part which return 0+1 to the ldepth.

if " if " part fails than else part is executed automatically so it should be rightdepth+1

Bro listen I also confused at beginning but look like this way left side is returning while right side is still executing (2 was left before so it get the returning value but at that point right start executing because function is over of indepth) when function finishes it start executing it's next part rather than completely exiting the whole functions it complicated but it behave in that mannner

@@shubhamshinde5643 Bro when ever "if" part fails or return false than else part is executed automatically , so when 0>0 in if part fails than directly else part is executed and rightdepth becomes 1 .

@@harshitrathi3077 did you find answer to this one? i am confused too

Function parameters are not evaluated in a defined order in C.

2+1 = 3

kaun sa nasha krti ho behn

it's 3

Yes height is 2

Empty tree height is -1 while single node it is zero . In fact height == number of arrows in that path