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

题库 第6626页

  • 最新
  • 浏览
  • 评论

若R.A→R.B,R.B→R.C,则R.A→R.C。

Luz5年前 (2021-05-10)1317
若R.A→R.B,R.B→R.C,则R.A→R.C。 ~@[](2)答案:TRUE…

The average run time and the extra space of Quicksort for sortin

Luz5年前 (2021-05-10)1005
The average run time and the extra space of Quicksort for sorting $$n$$ elements are $$O(n\log n)$$ and $$O(1)$$, respec…

The average run time and the extra space of Heapsort for sorting

Luz5年前 (2021-05-10)947
The average run time and the extra space of Heapsort for sorting $$n$$ elements are $$O(n\log n)$$ and $$O(1)$$, respect…

The storage size of a graph using the adjacency matrix is only r

Luz5年前 (2021-05-10)953
The storage size of a graph using the adjacency matrix is only related to the number of vertices but has nothing to do w…

The storage size of a graph using the adjacency list is only rel

Luz5年前 (2021-05-10)962
The storage size of a graph using the adjacency list is only related to the number of vertices but has nothing to do wit…

The inorder traversal sequence of any min-heap must be in sorted

Luz5年前 (2021-05-10)1499
The inorder traversal sequence of any min-heap must be in sorted order. ~@[](2)答案:FALSE…

The inorder traversal sequence of any max-heap must be in sorted

Luz5年前 (2021-05-10)1042
The inorder traversal sequence of any max-heap must be in sorted order. ~@[](2)答案:FALSE…

For a connected graph, if there are exactly two vertices having

Luz5年前 (2021-05-10)915
For a connected graph, if there are exactly two vertices having odd degree, we can find an Euler circuit that visits eve…

For a connected graph, if there are exactly two vertices having

Luz5年前 (2021-05-10)1202
For a connected graph, if there are exactly two vertices having odd degree, we can find an Euler tour that visits every…

If a general tree T is converted into a binary tree BT, then th

Luz5年前 (2021-05-10)1895
If a general tree T is converted into a binary tree BT, then the BT's pre-order traversal has the same sequence as that…