2. For an AVL tree with 2021 nodes, let x be the minimum possible height, y be the maximum height,

問題詳情

2. For an AVL tree with 2021 nodes, let x be the minimum possible height, y be the maximum
height, then (y-x) mod 5 is
(A)0
(B) 1
(C)2
(D)3
(E) 4