Talk:Leftist tree
Add topic | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
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)
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)
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)
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)
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)