Given the root of a binary tree, return its diameter: the number of nodes on the longest path between any two nodes (equivalently, between two leaves). The path may or may not pass through the root.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.