Image:Leftist-trees-S-value.png

From Wikipedia, the free encyclopedia

[edit] Summary

Showing how s-values work in leftist trees. In this diagram, the s-values are shown as calculated by including both the starting node and the leaf in the s-value.

[edit] Licensing

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current05:52, 19 November 2007210×131 (2 KB)Fresheneesz (Talk | contribs) (Get rid of "external nodes" which are an entirely unneccessary concept for explaining the s-value)
01:28, 8 April 2007287×160 (2 KB)Buss (Talk | contribs) (Showing how s-values work in leftist trees. The grey boxes are the external (imaginary) nodes which we count distance to. The top node, 4, must move twice to reach one of these external nodes.)
01:25, 8 April 2007287×160 (2 KB)Buss (Talk | contribs) (Showing how s-values work in leftist trees. The grey boxes are the external (imaginary) nodes which we count distance to. The top node, 4, must move twice to reach one of these external nodes.)

The following pages on the English Wikipedia link to this file (pages on other projects are not listed):