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

题库 第599页

  • 最新
  • 浏览
  • 评论

判断题:For a binary search tree, if its post-order travel sequence is {

Luz4年前 (2022-11-16)703
For a binary search tree, if its post-order travel sequence is { 30, 35, 45, 28, 64, 77, 68, 56 }, then 30 is the parent…

判断题:If a tree is created by union-by-size with n nodes, then each

Luz4年前 (2022-11-16)680
If a tree is created by union-by-size with $$n$$ nodes, then each element can have its set name changed at most $$\log n…

单选题:Consider a special queue which is a linear structure that allows

Luz4年前 (2022-11-16)460
Consider a special queue which is a linear structure that allows insertions at one end, yet deletions at both ends. Giv…

单选题:Consider a special queue which is a linear structure that allows

Luz4年前 (2022-11-16)597
Consider a special queue which is a linear structure that allows insertions at one end, yet deletions at both ends. Giv…

单选题:Which of the following statements is FALSE?

Luz4年前 (2022-11-16)596
Which of the following statements is FALSE?A.$$25n^3=\Theta (n^3)$$B.$$\sqrt n \log n = o(n)$$C.$$n\log n = \Omega (n^{1…

单选题:Among the following data structures, which one is non-linear?

Luz4年前 (2022-11-16)416
Among the following data structures, which one is non-linear?A.StackB.Complete binary treeC.QueueD.String答案:B…

单选题:Suppose that the level-order traversal sequence of a min-heap is

Luz4年前 (2022-11-16)476
Suppose that the level-order traversal sequence of a min-heap is { 3, 8, 12, 65, 17, 26, 82 }. Use the linear algorithm…

单选题:Suppose that the level-order traversal sequence of a max-heap is

Luz4年前 (2022-11-16)1121
Suppose that the level-order traversal sequence of a max-heap is { 82, 65, 17, 26, 8, 12, 3 }. Use the linear algorithm…

单选题:Which of the following statements is FALSE?

Luz4年前 (2022-11-16)572
Which of the following statements is FALSE?A.A directed acyclic gragh must be a tree.B.There must be no topological orde…

单选题:The array representation of the disjoint sets is given by S = {

Luz4年前 (2022-11-16)599
The array representation of the disjoint sets is given by S = { 2, 9, 2, -5, 4, 10, -1, 4, -4, 8 }. Keep in mind that th…