Tree problems test whether you can think recursively and avoid visiting the same nodes again and again. The common trick is to have one recursive call return a value to its parent while updating a global answer on the side. Use it for questions like the diameter or the longest path, where the best answer may not pass through the root. Calling a separate height function at every node works but costs O(n²), which is the trap interviewers watch for.