← Questions
Diameter of a binary tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Return the number of edges on the longest path between any two nodes of a binary tree. The path need not pass through the root. Solve it in one pass.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding