当前位置：首页
> Luz 第6777页
Luz 管理员
暂无介绍
89858 篇文章 33 次评论假定X和y为int型，则执行x=2; y=x+3/2; 后，y的值是3
假定X和y为int型，则执行x=2; y=x+3/2; 后，y的值是3 ~@[](2)答案：TRUE…
已知如下程序段：
已知如下程序段： int x = 10, y = 20, t = 0; if(x！=y) { t = x; x = y; y = t; } printf("%d,%d\n",x,y); 则程序输出结果为：20，10 ~@[](2)答案：T…
switch（x）中的x可以是整型、字符型或者浮点型变量
switch（x）中的x可以是整型、字符型或者浮点型变量 ~@[](2)答案：FALSE…
已知'A'的ASCII代码值为65，则'D'的ASCII代码值为68
已知'A'的ASCII代码值为65，则'D'的ASCII代码值为68 ~@[](2)答案：TRUE…
There exists a parallel algorithm to solve the maximum finding
There exists a parallel algorithm to solve the maximum finding problem with $$T(n) = O(1) $$ and $$ W(n) = O( n^{8/7}…
In a Red-Black Tree, if an internal black node is of degree 1, t
In a Red-Black Tree, if an internal black node is of degree 1, then it has only 1 descendant node.~@[](2)答案：TRUE…
For an AVL tree, all the balance factors of non-leaf nodes are 0
For an AVL tree, all the balance factors of non-leaf nodes are 0 iff it is a complete binary tree. ~@[](2)答案：FALSE…
Zig & Zig-zig & Zig-zag rotations not only move the accessed nod
Zig & Zig-zig & Zig-zag rotations not only move the accessed node to the root, but also roughly half the depth of most n…
In a Red-Black Tree, an internal red node is either a leaf or a
In a Red-Black Tree, an internal red node is either a leaf or a node of degree 2. ~@[](2)答案：TRUE…