例句 /

Binary Search Trees are useful for finding items in a list that changes infrequently.

Binary Search Trees are useful for finding items in a list that changes infrequently.

二叉搜索树在查找经常变化的列表时是很非常有用的。