Leftist heap

In lelftist heap every node has an s-value which is the distance to the nearest leaf. In contrast to a binary heap, a leftist tree attempts to be very unbalanced. In addition to the heap property, leftist trees are maintained so the right descendant of each node has the lower s-value.

Average rating: –

Please REGISTER or LOG IN, it's totally free! Registered users can
rate animations, add them among their favorites, and mark them as not working.

Source: https://www.cs.usfca.edu/~galles/visualization/LeftistHeap.html

<div style="padding:1px;background-color:#000;display:inline-block;"><iframe src="https://aa.ide.sk/DSV_en/LeftistHeap.html" scrolling="no" style="overflow:hidden; border:0px; width:1000px; height:640px;"></iframe><div style="background: #000;color:#999;font-size:12px;padding:3px;text-align:right;font-family:Arial,Helvetica,sans-serif">Source: <a href="https://www.cs.usfca.edu/~galles/visualization/LeftistHeap.html" target="_blank" style="color:#999;text-decoration:none">https://www.cs.usfca.edu/~galles/visualization/LeftistHeap.html</a></div></div>

Category:Heap data structures

Technology:JavaScript animation

Interactivity:Medium

Please REGISTER or LOG IN, it's totally free! Only registered users can write reviews!

Algorithm Animations and Visualizations

Leftist heap