Each edge in the binary tree is labelled with its length (not to scale). What is the minimum distance that the lazy squirrel can travel to get 1 acorn?

Bonus: Can you generalize/prove this result for larger trees with the same edge-length pattern?

Your answer seems reasonable.
Find out if you're right!