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

题库 第6097页

  • 最新
  • 浏览
  • 评论

单选题:若有定义:`int x,*pb;`则在以下正确的赋值表达式是

Luz5年前 (2021-05-10)1052
若有定义:`int x,*pb;`则在以下正确的赋值表达式是 @[A](2)A. `pb = &x`B. `pb = x`C. `*pb = &x`D. `*pb = *x`A.`pb = &x`B.`pb = x`C.`*pb = &…

单选题:![list.jpg](~/e8409833-8ff2-4a95-9c5f-23e90ed6ae4f.jpg)

Luz5年前 (2021-05-10)600
![list.jpg](~/e8409833-8ff2-4a95-9c5f-23e90ed6ae4f.jpg)Which one of the following is the data structure that is best rep…

单选题:Given the popping sequence of a stack as {1, 2, 3, 4, 5}. Among

Luz5年前 (2021-05-10)1261
Given the popping sequence of a stack as {1, 2, 3, 4, 5}. Among the following, the impossible pushing sequence is: @[C]…

单选题:Given the popping sequence of a stack as {a, b, c, d, e}. Among

Luz5年前 (2021-05-10)1035
Given the popping sequence of a stack as {a, b, c, d, e}. Among the following, the impossible pushing sequence is: @[B]…

单选题:A full tree of degree 4 is a tree in which every node other than

Luz5年前 (2021-05-10)969
A full tree of degree 4 is a tree in which every node other than the leaves has 4 children. How many leaves does a ful…

单选题:A full tree of degree 3 is a tree in which every node other than

Luz5年前 (2021-05-10)1223
A full tree of degree 3 is a tree in which every node other than the leaves has 3 children. How many leaves does a full…

单选题:A full tree of degree 3 is a tree in which every node other than

Luz5年前 (2021-05-10)926
A full tree of degree 3 is a tree in which every node other than the leaves has 3 children. How many leaves does a full…

单选题:Given the shape of a binary tree shown by the figure below. If

Luz5年前 (2021-05-10)1147
Given the shape of a binary tree shown by the figure below. If its inorder traversal sequence is { `e`, `a`, `c`, `b`,…

单选题:Given the shape of a binary tree shown by the figure below. If

Luz5年前 (2021-05-10)1125
Given the shape of a binary tree shown by the figure below. If its postorder traversal sequence is { `e`, `a`, `c`, `b`…

单选题:If graph G is NOT connected and has 27 edges, then it must have

Luz5年前 (2021-05-10)733
If graph G is NOT connected and has 27 edges, then it must have at least ____ vertices. @[C](3)A. 7B. 8C. 9D. 10A.7B.8C.…