Welcome guest!

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.

Category:Heap data structures

Technology:Javascript animation

Interactivity:Medium

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