A full binary tree is a tree where________________.( ) A: each node has exactly one or two children. B: all the leaves are at the same level. C: each node has exactly two children D: each node has exactly zero or two children.

A complete binary tree is a tree where________________.( ) A: each node has exactly one or two children B: each node has exactly zero or two children C: each node has exactly two children D: every level of the tree is completely filled except the last level

A Node structure in a linked list . A: consists of two parts, one for the node value and the other for a pointer to another node. B: has only one part to store the node value. C: has only one part to store the relationship pointer between the nodes. D: consists of two parts, one for the node value and the other for the number of bytes required by the node.

Which two steps are the result of associating a blade server?（） A: The compute node reboots and is then connected to the CMC B: A compute node is assigned to a service profile C: if the association is successful the cisco UCS manager boots the cisco UUOS to configure the compute node D: The compute node reboots to reload and then loads NX OS and establishes connections to both the CMC and the IOMs

An academic collaboration network is one type of social network. In such a network, a node with degree two means that: A: A scholar has coauthored a paper with one other scholar. B: A scholar has coauthored publications with two other scholars. C: A scholar has authored two publications. D: A publication was coauthored by two scholars.

K8S运行POD的节点称为 A: slave node B: master node C: worker node D: edge node

以下______参数可以影响冗余组节点状态。 A: node priority B: node system-mac C: node编号 D: node weight

设有以下定义： struct node { int data; struct node *next; }*p; 则以下的语句中正确的是（）。 A: p=malloc(sizeof(struct node)) B: p=(struct node *)malloc(sizeof(struct node)) C: *p=(struct node *)malloc(4) D: p=(struct node )malloc(sizeof(struct node))

有以下程序 #include struct NODE {int num; struct NODE *next; } main() {struct NODE *p,*q,*r; p=(struct NODE *)malloc(sizeof(struct NODE)); q=(struct NODE *)malloc(sizeof(struct NODE)); r=(struct NODE *)malloc(sizeof(struct NODE)); p->num=10;q->num=20;r->num=30; p->next=q;q->next=r; printf("%d ",p->num+q->next->num); } 程序运行后的输出结果是（ ）

决策树中包含以下哪些结点( ) A: 根结点（root node) B: 叶结点（leaf node） C: 内部结点（internal node） D: 外部结点（external node）