ind the two nodes in Binary Tree which have longest distance between them.

Should return I & C for following tree

A
/ \
B C
/ \
D E
/ \
F G
/
I

Click for Solution
[Insert Code]