The same old strategy: LinkedIn contact, recruiter call, phone/CoderPad interview. Later, I received an email rejecting me.

I must say, the interviewer was very junior. He even mentioned it was his first job, that he had only been there for two months, and yet he was assessing new engineers.

Well, I guess I didn't make the cut. The fact that my code was the best solution for the question, and they still rejected me, is puzzling.

I suspect the interviewer didn't know much about binary trees. More than that, he was very confused when I asked him if my code would handle cases with unbalanced binary trees. He said he wasn't aware of such a "data structure"... LOL, what a joke.

Given a binary tree, find the longest path length in the tree.