Consider the problem of summing n numbers by adding together various pairs of numbers and/or partial sums, for example, {[(3+1)+(2+5)]+9}.
(a) Represent this addition process with a tree. What will internal
vertices represent?
(b) What is the smallest possible height of an “addition tree” for
summing 100 numbers?
If u have any doubts in the solution ask it as a comment I will clarify. It may be difficult to understand, so if u gave any doubt ask me I will clarify
Get Answers For Free
Most questions answered within 1 hours.