Programmer 
Content
WIKIPEDIA X Who radicalized data structures into picking political sides? Leftist tree Article Talk JA 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.I 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.