当前位置：首页
> Luz 第6669页
Luz 管理员
暂无介绍
89859 篇文章 33 次评论In a Red-Black tree, the path from the root to the farthest leaf
In a Red-Black tree, the path from the root to the farthest leaf is no more than twice as long as the path from the root…
将{ 1, 2, 5, 3, 8, 4, -1, 10, 128, 34, 15, 63, 18, -24, 186 }插入一个
将{ 1, 2, 5, 3, 8, 4, -1, 10, 128, 34, 15, 63, 18, -24, 186 }插入一个初始为空的二项式队列，产生的根结点有 186、-24、15、-1。~@[](2)答案：TRUE…
With the same operations, the resulting skew heap is always more
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
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 }
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$$
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
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
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
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
A skew heap is a heap data structure implemented as a binary tree. Skew heaps are advantageous because of their ability…