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

题库 第6438页

  • 最新
  • 浏览
  • 评论

For any node in an AVL tree, the left and right subtrees must ha

Luz5年前 (2021-05-10)851
For any node in an AVL tree, the left and right subtrees must have the same height. ~@[](1)答案:FALSE…

Given a binary search tree with 20 integer keys which include 10

Luz5年前 (2021-05-10)1422
Given a binary search tree with 20 integer keys which include 10, 11, and 12, if 10 and 12 are on the same level, then 1…

To find 63 from a binary search tree, one possible searching seq

Luz5年前 (2021-05-10)1065
To find 63 from a binary search tree, one possible searching sequence is {39, 101, 25, 80, 70, 59, 63}. ~@[](3)答案:FALSE…

In a binary search tree, the keys on the same level from left to

Luz5年前 (2021-05-10)2934
In a binary search tree, the keys on the same level from left to right must be in sorted (non-decreasing) order. ~@[](2)…

合并排序算法是稳定的排序方法。

Luz5年前 (2021-05-10)923
合并排序算法是稳定的排序方法。 ~@[](1)答案:TRUE…

The time complexity of searching in a binary search tree is the

Luz5年前 (2021-05-10)1375
The time complexity of searching in a binary search tree is the same as that of binary search. ~@[](2)答案:FALSE…

在堆排序中,若要进行升序排序,则需要建立大根堆。( )

Luz5年前 (2021-05-10)2123
在堆排序中,若要进行升序排序,则需要建立大根堆。( ) ~@[](1)答案:TRUE…

起泡排序的排序趟数与参加排序的序列原始状态有关。

Luz5年前 (2021-05-10)1554
起泡排序的排序趟数与参加排序的序列原始状态有关。 ~@[](1)答案:TRUE…

当待排序记录已经从小到大排序或者已经从大到小排序时,快速排序的执行时间最省。

Luz5年前 (2021-05-10)1750
当待排序记录已经从小到大排序或者已经从大到小排序时,快速排序的执行时间最省。 ~@[](1)答案:FALSE…

堆是完全二叉树,完全二叉树不一定是堆。( )

Luz5年前 (2021-05-10)1246
堆是完全二叉树,完全二叉树不一定是堆。( ) ~@[](1)答案:TRUE…