题库 第6160页
单选题：If there are 14 nodes in an AVL tree, then the maximum depth of
If there are 14 nodes in an AVL tree, then the maximum depth of the tree is \_\_\_\_. The depth of an empty tree is defi…
单选题：Using the linear algorithm to build a min-heap from the sequence
Using the linear algorithm to build a min-heap from the sequence { 16, 28, 14, 13, 7, 6 }, and then DeleteMin. Which one…
单选题：Given the adjacency matrix of a graph as shown by the figure. Th
Given the adjacency matrix of a graph as shown by the figure. Then starting from V4, a possible DFS sequence is:A. must be uniqueB. must not be uniqueC. exists but may n…
单选题：Given input { 21, 85, 32, 49, 67, 1, 12 }. After the first parti
Given input { 21, 85, 32, 49, 67, 1, 12 }. After the first partition (with the median-of-three as the pivot) of quick so…
单选题：Given input { 25, 75, 32, 49, 67, 12, 21 }. After the first part
Given input { 25, 75, 32, 49, 67, 12, 21 }. After the first partition (with the median-of-three as the pivot) of quick s…
单选题：Given a hash table of size 13 and the hash function $$h(x)=x \%
Given a hash table of size 13 and the hash function $$h(x)=x \% 13$$. Assume that quadratic probing is used to solve col…
单选题：Given 4 cases of frequences of four characters. In which case(s)
Given 4 cases of frequences of four characters. In which case(s) that the total bits taken by Huffman codes are the same…
单选题：In a complete binary tree with 1238 nodes, there must be \_\_\_\
In a complete binary tree with 1238 nodes, there must be \_\_\_\_ leaf nodes.@[B](3)A. 215B. 619C. 214D. 620A.215B.619C.…
