-->
当前位置:首页 > 题库

题库 第6512页

  • 最新
  • 浏览
  • 评论

With the same operations, the resulting skew heap is always more

Luz5年前 (2021-05-10)935
With the same operations, the resulting skew heap is always more balanced than the leftist heap. ~@[](1)答案:FALSE…

Insert { 1, 2, 5, 3, 8, 4, -1, 10, 128, 34, 15, 63, 18, -24, 186

Luz5年前 (2021-05-10)912
Insert { 1, 2, 5, 3, 8, 4, -1, 10, 128, 34, 15, 63, 18, -24, 186 } into an initially empty binomial queue, the resulting…

Insert { 1, 2, 5, 3, 8, 4, -7, 10, 88, 34, 15, 63, 18, -18, 96 }

Luz5年前 (2021-05-10)807
Insert { 1, 2, 5, 3, 8, 4, -7, 10, 88, 34, 15, 63, 18, -18, 96 } into an initially empty binomial queue, the resulting r…

A leftist heap with the null path length of the root being $$r$$

Luz5年前 (2021-05-10)899
A leftist heap with the null path length of the root being $$r$$ must have at least $$2^{r+1}-1$$ nodes. ~@[](2)答案:TRUE…

Inserting a number into a binomial heap with 11 nodes costs more

Luz5年前 (2021-05-10)828
Inserting a number into a binomial heap with 11 nodes costs more time than inserting a number into a binomial heap with…

For any black node X in a Red-Black tree, if it has two children

Luz5年前 (2021-05-10)890
For any black node X in a Red-Black tree, if it has two children, then the children's colors may be different. ~@[](1)…

Given a Huffman tree for $$N$$ ($$\ge 2$$) characters, all with

Luz5年前 (2021-05-10)1200
Given a Huffman tree for $$N$$ ($$\ge 2$$) characters, all with different weights. The weight of any non-leaf node must…

A skew heap is a heap data structure implemented as a binary tre

Luz5年前 (2021-05-10)964
A skew heap is a heap data structure implemented as a binary tree. Skew heaps are advantageous because of their ability…

If a complete binary tree with 137 nodes is stored in an array (

Luz5年前 (2021-05-10)1821
If a complete binary tree with 137 nodes is stored in an array (root at position 1), then the nodes at positions 127 and…

考虑最大割问题的一种状态反转算法。我们称两种分割 $$(A, B)$$ 和 $$(A', B')$$ 是 $$k$$ 反转规则下

Luz5年前 (2021-05-10)881
考虑最大割问题的一种状态反转算法。我们称两种分割 $$(A, B)$$ 和 $$(A', B')$$ 是 $$k$$ 反转规则下的相邻解,如果 $$(A', B')$$ 是通过把 $$(A, B)$$ 中最多 $$k$$ 个结点从分割的一边…