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:
“Is it a new spring star
Within the timing chill,
Talking, or just a mime,
That rises in the blood
Thin Jack-and-Jilling seas
Without the human will?”
—Allen Tate (1899–1979)
“A commodity appears at first sight an extremely obvious, trivial thing. But its analysis brings out that it is a very strange thing, abounding in metaphysical subtleties and theological niceties.”
—Karl Marx (1818–1883)