题库 第5941页
单选题：When solving a problem with input size $$N$$ by divide and conqu
When solving a problem with input size $$N$$ by divide and conquer, if at each step, the problem is divided into 4 sub-p…
单选题：The potential of a skew heap is defined to be the total number o
The potential of a skew heap is defined to be the total number of right heavy nodes. The weight of a node, $$w(x)$$, is…
单选题：Suppose that the devide-and-conquer strategy is used to find the
Suppose that the devide-and-conquer strategy is used to find the maximum and the minimum of $$N$$ positive numbers. At…
单选题：Which one of the following statements is **TRUE**?
Which one of the following statements is **TRUE**? @[A](2)A. may b…
单选题：To delete X from a splay tree, the operations are: (1) Find X; (
To delete X from a splay tree, the operations are: (1) Find X; (2)Remove X; (3) FindMin($$T_R$$); and the last operation…
单选题：In a binomial queue with $$100$$ nodes, how many nodes have dept
In a binomial queue with $$100$$ nodes, how many nodes have depth $$1$$ (the root has depth $$0$$)? @[B](2)A. 6B. 13C.…
单选题：Delete the minimum number from the binomial queue given in the f
Delete the minimum number from the binomial queue given in the following figure. Which one of the following statements…
单选题：Insert { 3, 1, 4, 5, 0, 9, 2, 6, 8, 7 } into an initially empty
Insert { 3, 1, 4, 5, 0, 9, 2, 6, 8, 7 } into an initially empty 2-3 tree (with splitting). Which one of the following s…
单选题：Insert { 5, 1, 7, 8, 21, 2, 12, 19, 13, 0 } into an initially em
Insert { 5, 1, 7, 8, 21, 2, 12, 19, 13, 0 } into an initially empty 2-3 tree (with splitting). Which one of the followi…
单选题：Given a linked list containg $$N$$ nodes. Our task is to remove
Given a linked list containg $$N$$ nodes. Our task is to remove all the nodes. At each step, we randomly choose one nod…
