Timing Analysis
A weight balanced tree gives close to optimal values for the expected length of successful search calculations. From the above example we get
ELOSS = depth(node A)*probability(node A) + depth(node C)*probability(node C) + ...
ELOSS = 2*0.17 + 5*0.03 + 4*0.09 + 3*0.12 + 1*0.20 + 3*0.11 + 3*0.10 + 2*0.18
ELOSS = 2.5
This is the expected number of nodes that will be examined before finding the desired node.
Read more about this topic: Weight-balanced Tree
Famous quotes containing the words timing and/or analysis:
“A great man always considers the timing before he acts.”
—Chinese proverb.
“Ask anyone committed to Marxist analysis how many angels on the head of a pin, and you will be asked in return to never mind the angels, tell me who controls the production of pins.”
—Joan Didion (b. 1934)