Talk:Leftist tree

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Mid

This article has been rated as Mid-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

s-value[edit]

The example seems incorrect--5 is not a leaf, but rather one node from a leaf. If s(4) is 2, then s(5) should be 1, and s(6) and s(8) should be 0. 141.210.84.154 (talk) 19:51, 12 January 2009 (UTC)[reply]

Dude, more then that! S(4) = 1 since 8 is a leaf and it's one away. right? is it the minimum distance to _any_ leaf? this section is unclear. —Preceding unsigned comment added by 216.73.251.252 (talk) 20:35, 17 March 2009 (UTC)[reply]

No, read the S-Value section to the right of the picture. 8 is NOT a leaf; you need to `fill out' the tree by adding two leaves to 8, two leaves to 6, and one leaf to 5. Thus, S(4) is 2 because from 4 you go -> 8 -> Leaf. — Preceding unsigned comment added by 81.187.29.210 (talk) 04:01, 29 September 2013 (UTC)[reply]

yes, it is[edit]

Is a leftist tree just like a leftist heap? What is the difference? If they're different, should a new stub be created for leftist heaps? Gflores 04:00, 30 October 2005 (UTC)[reply]

Merge[edit]

Is the description of merging right? Its a terrible description, but it might also be wrong. so... thats not good. Fresheneesz (talk) 10:59, 18 November 2007 (UTC)[reply]