题目内容

15 After compressing and storing the following matrix, it is ( ) that loses the random access function.

A. sparse matrix
B. symmetric matrix
C. triangular matrix
D. tridiagonal matrix

查看答案

搜索结果不匹配？点我反馈

更多问题

1 The most suitable structure for a tree is ().

A. Structure with branches and hierarchical relationships between elements
B. Ordered structure between element
C. Disordered structure between elements
D. Unconnected structure

查看答案

2 Assuming that the number of nodes of a binary tree is 18, its height is at least ().

A. 4
B. 5
C. 6
D. 18

查看答案

3 The relative position of the leaf node of any binary tree in its preorder, inorder, and postorder sequence ().

A. Definitely not changed
B. Must change
C. Sometimes changes
D. Unconfirmed

查看答案

4 The condition for judging that a node P in the threaded binary-tree has a left child is ().

A. p->LTag==0
B. p!=NULL
C. p->lchild!=NULL
D. p->LTag==1

查看答案

15 After compressing and storing the following matrix, it is ( ) that loses the random access function.

A. sparse matrix B. symmetric matrix C. triangular matrix D. tridiagonal matrix

1 The most suitable structure for a tree is ().

2 Assuming that the number of nodes of a binary tree is 18, its height is at least ().

3 The relative position of the leaf node of any binary tree in its preorder, inorder, and postorder sequence ().

4 The condition for judging that a node P in the threaded binary-tree has a left child is ().

A. sparse matrix
B. symmetric matrix
C. triangular matrix
D. tridiagonal matrix