(A) AVL trees are binary trees. (B) AVL trees are heap structures. (C) AVL trees are ideal for storing items of an ordered dictionary. (D) ...
確定! 回上一頁