Lazy Squirrel Learns Tough Programming

The length of each edge in the binary tree is given as a real number element of an array/list: \[a=\left[a[0],a[1],\ldots,a[2^{n+1}-2]\right].\] At each of the \(2^n\) leaves, there is an acorn. The squirrel is lazy and wants to travel the minimum possible distance to get 1 acorn, so the squirrel learns to program. If \(a\) is given by the list in the attached file, what is the minimum distance the squirrel has to walk?

View and download additional files for this problem
×

Problem Loading...

Note Loading...

Set Loading...