A tree has root N. Each node branches to its divisors other than 1 and the node itself. Find the maximum height of the tree, counted in edges. For N = 8 the answer is 2 (8, 4, 2).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.