Gamified challenge · Recursion
The village is a binary tree of houses: each house links down to at most two neighbours. tree is given in level order with null for a missing house (TreeNode in code). Cable can only run along the links, and each link is one segment.
Write diameter(tree) that returns the most segments a single cable can have between any two houses: the cable doesn't have to pass through the top house. An empty village or a single house needs 0.
For [1, 2, 3, 4, 5] the answer is 3: from house 4 up to 2, up to 1, down to 3 (or from 5 the same way).
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google