How to find height or maximum depth of binary of binary tree ?
Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
Note: A leaf is a node with no children.
Given binary tree [3,9,20,null,null,15,7],
return its depth = 3.
noob Answered question
You might also be interested in reading this as the above problem is a subset of this:-
goli202084 Changed status to publish