网站首页  情感咨询  情感美文  情感百科  情感生活  学习充电  旧版美文

请输入您要查询的词汇:

 

词汇 Leftist tree
分类 英语词汇 英语翻译词典
释义

Leftist tree

中文百科

左偏树

左偏树的节点的距离值
Initializing a min HBLT - Part 1
Initializing a min HBLT - Part 3

左偏树(英语:leftist treeleftist heap),也可称为左偏堆、左倾堆,是计算机科学中的一种树,是一种优先队列实现方式,属于可并堆,在信息学中十分常见,在统计问题、最值问题、模拟问题和贪心问题等等类型的题目中,左偏树都有着广泛的应用。斜堆是比左偏树更为一般的数据结构。

左偏堆的合并操作的平摊时间复杂度为O(log n),而完全二叉堆为O(n)。左偏堆适合基于合并操作的情形。

由于左偏堆已经不是完全二叉树,因此不能用数组存储表示,需要用链接结构。

英语百科

Leftist tree 左偏树

S-values of a leftist tree
Initializing a min HBLT - Part 1
Initializing a min HBLT - Part 3

In computer science, a leftist tree or leftist heap is a priority queue implemented with a variant of a binary 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.

随便看

 

依恋情感网英汉例句词典收录3870147条英语例句词条,基本涵盖了全部常用英语单词的释义及例句,是英语学习的有利工具。

 

Copyright © 2004-2024 Yiyi18.com All Rights Reserved
京ICP备2021023879号 更新时间:2025/8/5 9:09:35