Leftist tree
id:
leftist-tree-193-10378226
title:
Leftist tree
text:
In computer science, a leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node x has an s-value which is the distance to the nearest leaf in subtree rooted at x. 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. The height-biased leftist tree was invented by Clark Allan Crane. The name comes from the
brand slug:
wiki
category slug:
encyclopedia
description:
Priority queue implemented with a variant of a binary heap
original url:
https://en.wikipedia.org/wiki/Leftist_tree
date created:
date modified:
2024-01-13T01:59:04Z
main entity:
{"identifier":"Q627595","url":"https://www.wikidata.org/entity/Q627595"}
image:
fields total:
13
integrity:
14