we need to traverse the BST to the left recursivly until we reach the
node of left is null. we would have reached the node for which left
pointer is null.. so we are in leaf node .. so we can easily calculate
the height of the node
Is my solution is correct... if any thing is wrong
with me.. pls revert me back..
Thanks & Regards
Sathiyan K
On Dec 18, 11:48 am, richa <[email protected]> wrote:
> . 10
> 6 12
>
> 4-> 5 <-------->11<-----> 13 <--
> |_______________________|
> (I have tried my best!)
> Ok.. In the BST you have the leaf nodes connected to form a doubly LL.
> Given a node, identify its height
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
