每个选项独立判分
Let TTT be the splay tree that is obtained from an empty tree by the following operations: insert(1), insert(2), insert(3), insert(4), insert(5), findkey(2), findkey(3). Select all the true statements from the followings.
3 is the root of TTT.
2 is a child of 1
4 is a child of 5
the balanced factor of any node of TTT is at most 1
Select all the leftist heaps from the followings. Assume that the keys already satidfy the heap property.
aaa
bbb
ccc
Which of the following statements about Huffman’s greedy algorithm are true? Assume that the symbol frequencies sum to 1. (Choose all that apply.)
A letter with frequency at least 0.4 will never be encoded with two or more bits.
A letter with frequency at least 0.5 will never be encoded with two or more bits.
If all symbol frequencies are less than 0.33, all symbols will be encoded with at least two bits.
If all symbol frequencies are less than 0.5, all symbols will be encoded with at least two bits.