17 下列何種順序所建造的二元搜尋樹（Binary Search Tree）最為平衡（Balanced）？
(A) 40, 30, 60, 15, 35, 51, 90
(B) 15, 30, 35, 40, 51, 60, 90
(C) 90, 60, 51, 40, 35, 30, 15
(D) 60, 90, 51, 40, 35, 30, 15

答案：登入後查看
統計： A(82), B(25), C(8), D(4), E(0) #675229